Sciweavers

2520 search results - page 151 / 504
» The complexity of approximating entropy
Sort
View
93
Voted
GEOINFORMATICA
1998
144views more  GEOINFORMATICA 1998»
14 years 10 months ago
Approximation-Based Similarity Search for 3-D Surface Segments
The issue of ®nding similar 3-D surface segments arises in many recent applications of spatial database systems, such as molecular biology, medical imaging, CAD, and geographic i...
Hans-Peter Kriegel, Thomas Seidl
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 9 months ago
Approximate Judgement Aggregation
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
Ilan Nehama
ICASSP
2011
IEEE
14 years 2 months ago
A convex approximation approach to weighted sum rate maximization of multiuser MISO interference channel under outage constraint
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
Wei-Chiang Li, Tsung-Hui Chang, Che Lin, Chong-Yun...
115
Voted
CVPR
1997
IEEE
16 years 25 days ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
CVPR
2004
IEEE
16 years 25 days ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell