Sciweavers

4112 search results - page 186 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
MOBIHOC
2009
ACM
16 years 7 months ago
Efficient uncoordinated FHSS anti-jamming communication
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
Mario Strasser, Christina Pöpper, Srdjan Capk...
CVPR
2010
IEEE
15 years 8 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
SIGGRAPH
1997
ACM
15 years 10 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 8 months ago
Improved approximation algorithms for rectangle tiling and packing
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, ...
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 6 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi