Sciweavers

1096 search results - page 107 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
WOSP
2004
ACM
15 years 11 months ago
Using locality of reference to improve performance of peer-to-peer applications
Peer-to-peer, or simply P2P, systems have recently emerged as a popular paradigm for building distributed applications. One key aspect of the P2P system design is the mechanism us...
Marcelo Werneck Barbosa, Melissa Morgado Costa, Ju...
ECCV
2010
Springer
15 years 11 months ago
Partition Min-Hash for Partial Duplicate Image Discovery
In this paper, we propose Partition min-Hash (PmH), a novel hashing scheme for discovering partial duplicate images from a large database. Unlike the standard min-Hash algorithm th...
CONSTRAINTS
2002
111views more  CONSTRAINTS 2002»
15 years 6 months ago
A Constraint-Based Interactive Train Rescheduling Tool
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
C. K. Chiu, C. M. Chou, Jimmy Ho-Man Lee, Ho-fung ...
AAAI
2011
14 years 6 months ago
Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
Chloe Kiddon, Pedro Domingos
ACNS
2006
Springer
86views Cryptology» more  ACNS 2006»
15 years 10 months ago
Efficient Memory Bound Puzzles Using Pattern Databases
CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. However, the wide disparity in CPU speeds prevents such puzzles from being...
Sujata Doshi, Fabian Monrose, Aviel D. Rubin