Sciweavers

274 search results - page 39 / 55
» Computational complexity of queries based on itemsets
Sort
View
101
Voted
CGF
2007
158views more  CGF 2007»
15 years 13 days ago
Soft Articulated Characters with Fast Contact Handling
Fast contact handling of soft articulated characters is a computationally challenging problem, in part due to complex interplay between skeletal and surface deformation. We presen...
Nico Galoppo, Miguel A. Otaduy, Serhat Tekin, Mark...
95
Voted
PERCOM
2010
ACM
14 years 11 months ago
Concurrent scheduling in the Active Bat location system
Abstract—This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with high...
Oliver Woodman, Robert Harle
122
Voted
ICIP
2008
IEEE
16 years 2 months ago
Local feature extraction for video copy detection in a database
In this paper a new content-based copy identification method for video sequences is presented. It is robust to a number of image transformations and particulary robust to compress...
Ehsan Maani, Sotirios A. Tsaftaris, Aggelos K. Kat...
116
Voted
DASFAA
2009
IEEE
133views Database» more  DASFAA 2009»
15 years 7 months ago
Probabilistic Ranking in Uncertain Vector Spaces
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
99
Voted
IPTPS
2005
Springer
15 years 6 months ago
Arpeggio: Metadata Searching and Content Sharing with Chord
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
Austin T. Clements, Dan R. K. Ports, David R. Karg...