Sciweavers

728 search results - page 93 / 146
» Efficient Searching with Linear Constraints
Sort
View
ICIP
2002
IEEE
16 years 7 months ago
Exploiting group structure to improve retrieval accuracy and speed in image databases
Most image retrieval systems perform a linear search over the database to find the closest match to a query. However, databases usually exhibit a natural grouping structure into c...
Nuno Vasconcelos
IWPEC
2010
Springer
15 years 3 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 2 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
AIPS
2008
15 years 8 months ago
Planning for Modular Printers: Beyond Productivity
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
Minh Binh Do, Wheeler Ruml, Rong Zhou
ICPR
2004
IEEE
16 years 7 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach