Sciweavers

5448 search results - page 995 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
99
Voted
ECCV
2002
Springer
16 years 2 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
199
Voted
GIS
2004
ACM
16 years 1 months ago
A partial join approach for mining co-location patterns
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
Jin Soung Yoo, Shashi Shekhar
ICML
2006
IEEE
16 years 1 months ago
Learning to impersonate
Consider Alice, who is interacting with Bob. Alice and Bob have some shared secret which helps Alice identify Bob-impersonators. Now consider Eve, who knows Alice and Bob, but doe...
Moni Naor, Guy N. Rothblum
CHI
2009
ACM
16 years 1 months ago
Remote impact: shadowboxing over a distance
Florian `Floyd' Mueller Distance Lab Horizon Scotland The Enterprise Park Forres, Moray IV36 2AB UK floyd@exertioninterfaces.com Stefan Agamanolis Distance Lab Horizon Scotlan...
Florian Mueller, Stefan Agamanolis, Martin R. Gibb...
SPAA
2009
ACM
16 years 1 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa