Sciweavers

163 search results - page 25 / 33
» K-Nearest Neighbor Search using the Pyramid Technique
Sort
View
TIT
2008
122views more  TIT 2008»
13 years 10 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
ICDE
2006
IEEE
126views Database» more  ICDE 2006»
15 years 6 days ago
Enabling Query Processing on Spatial Networks
A system that enables real time query processing on large spatial networks is demonstrated. The system provides functionality for processing a wide range of spatial queries such a...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
PR
2007
116views more  PR 2007»
13 years 10 months ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
TMM
2010
231views Management» more  TMM 2010»
13 years 5 months ago
Real-Time Visual Concept Classification
As datasets grow increasingly large in content-based image and video retrieval, computational efficiency of concept classification is important. This paper reviews techniques to ac...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...
FLAIRS
2004
14 years 7 days ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar