338 search results - page 27 / 68 » Approximation Spaces and Information Granulation |
103
click to vote
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
We apply the concept of natural gradients to deformable registration. The motivation stems from the lack of physical interpretation for gradients of image-based difference measure...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
98
Voted
VLDB
2004
ACM
15 years 2 months ago
2004
ACM
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
78
Voted
CP
2006
Springer
15 years 1 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
122
click to vote
SPIRE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...