Sciweavers

1258 search results - page 33 / 252
» Collection Oriented Match
Sort
View
ACCV
2006
Springer
14 years 1 months ago
Fast Approximated SIFT
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
Michael Grabner, Helmut Grabner, Horst Bischof
DKE
2008
96views more  DKE 2008»
13 years 7 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
ICIAR
2009
Springer
14 years 2 months ago
Scale Invariant Feature Transform with Irregular Orientation Histogram Binning
The SIFT (Scale Invariant Feature Transform) descriptor is a widely used method for matching image features. However, perfect scale invariance can not be achieved in practice becau...
Yan Cui, Nils Hasler, Thorsten Thormählen, Ha...
ERCIMDL
2007
Springer
127views Education» more  ERCIMDL 2007»
14 years 1 months ago
Lyrics-Based Audio Retrieval and Multimodal Navigation in Music Collections
Modern digital music libraries contain textual, visual, and audio data describing music on various semantic levels. Exploiting the availability of different semantically interrela...
Meinard Müller, Frank Kurth, David Damm, Chri...
LCTRTS
2007
Springer
14 years 1 months ago
Hierarchical real-time garbage collection
Memory management is a critical issue for correctness and performance in real-time embedded systems. Recent work on real-time garbage collectors has shown that it is possible to p...
Filip Pizlo, Antony L. Hosking, Jan Vitek