Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
248
Materials for an exploratory theory of the network society.
- The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract
-
Cited by 122 (0 self)
- Add to MetaCart
of social structure that I call the network society for reasons that hopefully will become apparent. I shall summarize below the main features of these transformations, in a sequential order that does not imply hierarchy of causation in any way. We have entered a new technological paradigm, centred around
The shape Boltzmann machine: A strong model of object shape
- In CVPR
, 2012
"... A good model of object shape is essential in applications such as segmentation, object detection, inpainting and graphics. For example, when performing segmentation, local constraints on the shape can help where the object boundary is noisy or unclear, and global constraints can resolve ambiguities ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
A good model of object shape is essential in applications such as segmentation, object detection, inpainting and graphics. For example, when performing segmentation, local constraints on the shape can help where the object boundary is noisy or unclear, and global constraints can resolve ambiguities
Learning potential-based policies from constrained motion
, 2008
"... Abstract—We present a method for learning potential-based policies from constrained motion data. In contrast to previous approaches to direct policy learning, our method can combine observations from a variety of contexts where different constraints are in force, to learn the underlying unconstraine ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
subsets of the data and learn a global model from a cleanly pre-processed training set. We demonstrate our approach on systems of varying complexity, including kinematic data from the ASIMO humanoid robot with 22 degrees of freedom. I.
1On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD
, 2013
"... This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion ..."
Abstract
- Add to MetaCart
This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion
Automatic program repair with evolutionary computation,”
- Commun. ACM,
, 2010
"... Abstract There are many methods for detecting and mitigating software errors but few generic methods for automatically repairing errors once they are discovered. This paper highlights recent work combining program analysis methods with evolutionary computation to automatically repair bugs in off-th ..."
Abstract
-
Cited by 34 (5 self)
- Add to MetaCart
(Section 2.2) choices. We then detail the GP-based repair strategy (Section 2.3), discussing the genetic operators (Section 2.4), which modify the representation, and the fitness function (Section 2.5), which uses test cases to evaluate the results of the modifications. Finally, a postprocessing step
On a mathematical model for thick surfaces
- Physical and Numerical Models in Knot Theory
, 2005
"... Motivated by previous work on elastic rods with self-contact, involving the concept of the global radius of curvature for curves (as defined by Gonzalez and Maddocks), we define the global radius of curvature 4[X] for a wide class of parametric surfaces. It turns out that a positive lower bound 4[X] ..."
Abstract
-
Cited by 6 (6 self)
- Add to MetaCart
] ≥ θ> 0 provides, naively speaking, the surface with a thickness of magnitude θ; it serves as an excluded volume constraint for X, prevents self-intersections, and implies that the image of X is an embedded C1-manifold with a Lipschitz continuous normal. Taking into account possible applications
Human sensorimotor learning: adaptation, skill, and beyond.
- Current Opinion in Neurobiology,
, 2011
"... Recent studies of upper limb movements have provided insights into the computations, mechanisms, and taxonomy of human sensorimotor learning. Motor tasks differ with respect to how they weight different learning processes. These include adaptation, an internal-model based process that reduces senso ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
Recent studies of upper limb movements have provided insights into the computations, mechanisms, and taxonomy of human sensorimotor learning. Motor tasks differ with respect to how they weight different learning processes. These include adaptation, an internal-model based process that reduces
Left Ventricle Endocardium Segmentation for Cardiac CT Volumes Using an Optimal Smooth Surface
"... We recently proposed a robust heart chamber segmentation approach based on marginal space learning. 1, 2 In this paper, we focus on improving the LV endocardium segmentation accuracy by searching for an optimal smooth mesh that tightly encloses the whole blood pool. The refinement procedure is formu ..."
Abstract
- Add to MetaCart
is formulated as an optimization problem: maximizing the surface smoothness under the tightness constraint. The formulation is a convex quadratic programming problem, therefore has a unique global optimum and can be solved efficiently. Our approach has been validated on the largest cardiac CT dataset (457
1Local Identification of Overcomplete Dictionaries
"... This paper presents the first theoretical results showing that stable identification of overcomplete µ-coherent dictionaries Φ ∈ Rd×K is locally possible from training signals with sparsity levels S up to the order O(µ−2) and signal to noise ratios up to O( d). In particular the dictionary is recove ..."
Abstract
- Add to MetaCart
criterion, a very simple Iterative Thresholding & K (signed) Means algorithm (ITKM), which has complexity O(dKN) in each iteration, is presented and its local efficiency is demonstrated in several experiments. Index Terms dictionary learning, dictionary identification, sparse coding, sparse component
Results 1 - 10
of
248
