Sciweavers

393 search results - page 67 / 79
» Computer Expression Recognition Toolbox
Sort
View
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
14 years 1 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
ICPR
2008
IEEE
14 years 9 months ago
Learning invariant region descriptor operators with genetic programming and the F-measure
Recognizing and localizing objects is a classical problem in computer vision that is an important stage for many automated systems. In order to perform object recognition many res...
Cynthia B. Pérez, Gustavo Olague
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 2 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz
DASFAA
2006
IEEE
183views Database» more  DASFAA 2006»
14 years 2 months ago
Probabilistic Similarity Join on Uncertain Data
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the n...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei