Sciweavers

1489 search results - page 167 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
PAMI
1998
107views more  PAMI 1998»
14 years 9 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
STOC
2003
ACM
178views Algorithms» more  STOC 2003»
15 years 10 months ago
Uniform hashing in constant time and linear space
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Anna Östlin, Rasmus Pagh
ER
2010
Springer
164views Database» more  ER 2010»
14 years 8 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
SIGMOD
2003
ACM
144views Database» more  SIGMOD 2003»
15 years 10 months ago
A Multi-paradigm Querying Approach for a Generic Multimedia Database Management System
To truly meet the requirements of multimedia database (MMDB) management, an integrated framework for modeling, managing and retrieving various kinds of media data in a uniform way...
Ji-Rong Wen, Qing Li, Wei-Ying Ma, HongJiang Zhang
71
Voted
CIDM
2007
IEEE
15 years 2 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...