Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
768
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract
-
Cited by 892 (13 self)
- Add to MetaCart
regular fashion. These arise regularly in connection with extremal structures: such structures often have an unexpected degree of regularity and, because of this, often give rise to an association scheme. This in turn leads to a semisimple commutative algebra and the representation theory of this algebra
SIGNAL RECOVERY BY PROXIMAL FORWARD-BACKWARD SPLITTING
- MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract
-
Cited by 509 (24 self)
- Add to MetaCart
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a
Monitoring and self-repair in speech
- Cognition
, 1983
"... Making a self-repair in speech typically proceeds in three phases. The first phase involves the monitoring of one’s own speech and the interruption of the flow of speech when trouble is detected. From an analysis of 959 spontaneous self-repairs it appears that interrupting follows detection promptly ..."
Abstract
-
Cited by 279 (11 self)
- Add to MetaCart
on the nature of the speech trouble in a rather regular fashion: Speech errors induce other editing terms than words that are merely inappropriate, and trouble which is detected quickly by the speaker is preferably signalled by the use of ‘uh’. The third phase consists of making the repair proper
Graph Cuts and Efficient N-D Image Segmentation
, 2006
"... Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of graph-cuts: segmentation of objects in image data. Despite its simplicity, this application epitomizes the best features ..."
Abstract
-
Cited by 307 (7 self)
- Add to MetaCart
shown to have interesting connections with earlier segmentation methods such as snakes, geodesic active contours, and level-sets. The segmentation energies optimized by graph cuts combine boundary regularization with region-based properties in the same fashion as Mumford-Shah style functionals. We
Learning query intent from regularized click graphs
- In SIGIR 2008
, 2008
"... This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a unified user interface. Previous works on query classification have primarily focused on improving feature representation ..."
Abstract
-
Cited by 114 (12 self)
- Add to MetaCart
, we infer class memberships of unlabeled queries from those of labeled ones according to their proximities in a click graph. Moreover, we regularize the learning with click graphs by content-based classification to avoid propagating erroneous labels. We demonstrate the effectiveness of our algorithms
Spherical Topological Relations
, 2005
"... Analysis of global geographic phenomena requires non-planar models. In the past, models for topological relations have focused either on a two-dimensional or a three-dimensional space. When applied to the surface of a sphere, however, neither of the two models suffices. For the two-dimensional plan ..."
Abstract
-
Cited by 152 (22 self)
- Add to MetaCart
that cannot be realized in the plane. These relations complete the conceptual neighborhood graph of the eight planar topological relations in a regular fashion, providing evidence for a regularity of the underlying mathematical model. The analysis of the algebraic compositions of spherical topological
From Rote Learning to System Building: Acquiring Verb Morphology in Children and Connectionist Nets
- Cognition
, 1993
"... The traditional account of the acquisition of English verb morphology supposes that a dual architecture underlies the transition from early rote learning processes (in which past tense forms of verbs are correctly produced) to the systematic treatment of verbs (in which irregular verbs are prone to ..."
Abstract
-
Cited by 189 (6 self)
- Add to MetaCart
-layered perceptron learns to map verb stems to past tense forms analogous to the mappings found in the English past tense system. By expanding the training set in a gradual, incremental fashion and evaluating network performance on both trained and novel verbs at successive points in learning, it is demonstrated
Mura, European Fashion Design
"... Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form of a matrix of pieces in size numbers and designs, the task is to find a list of combinations of size numbers to complete ..."
Abstract
- Add to MetaCart
instances from industrial clothes production and the results compare favorably with those produced by the algorithm regularly used in practice.
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
that in weak reconstruction FFT can still be applied if k-space is sampled in a regular Cartesian fashion. For this reason sensitivity encoding with Cartesian sampling is particularly feasible. Moreover, the reconstruction mechanism is relatively easily understood in this case. Therefore, the first part
Bagging regularizes
- AI Memo 2002-003, CBCL Memo 214, MIT AI Lab
, 2002
"... Intuitively, we expect that averaging — or bagging — different regressors with low correlation should smooth their behavior and be somewhat similar to regularization. In this note we make this intuition precise. Using an almost classical definition of stability, we prove that a certain form of avera ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
of averaging provides generalization bounds with a rate of convergence of the same order as Tikhonov regularization — similar to fashionable RKHSbased learning algorithms.
Results 1 - 10
of
768
