2969 search results - page 202 / 594 » A space efficient algorithm for group structure computation |
245
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
112
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
150
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper describes a new algorithm for recovering the
3D shape and motion of deformable and articulated objects
purely from uncalibrated 2D image measurements using an
iterati...
156
click to vote
PVLDB
2010
14 years 10 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
143
click to vote
DASC
2006
IEEE
15 years 7 months ago
2006
IEEE
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...