Sciweavers

1968 search results - page 63 / 394
» The Complexity of Valued Constraint Models
Sort
View
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 2 months ago
Clustering from Constraint Graphs
In constrained clustering it is common to model the pairwise constraints as edges on the graph of observations. Using results from graph theory, we analyze such constraint graphs ...
Ari Freund, Dan Pelleg, Yossi Richter
MVA
1990
101views Computer Vision» more  MVA 1990»
15 years 2 months ago
Recognition of Parametrised Models from 3D Data
This paper describes work done as part of the Oxford AGV (Autonomous Guided Vehicle) project [2] towards recognition of classes of objects to be encountered in a factory environme...
Ian D. Reid
ICIP
2009
IEEE
16 years 2 months ago
Dequantizing Compressed Sensing With Non-gaussian Constraints
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
ICC
2007
IEEE
125views Communications» more  ICC 2007»
15 years 5 months ago
Increasing Power Efficiency in Transmitter Diversity Systems under Error Performance Constraints
Motivated by combinatorial optimization theory, we propose an algorithmic power allocation method that minimizes the total transmitting power in transmitter diversity systems, prov...
Diomidis S. Michalopoulos, Athanasios S. Lioumpas,...
CPAIOR
2009
Springer
15 years 8 months ago
Learning How to Propagate Using Random Probing
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
Efstathios Stamatatos, Kostas Stergiou