Sciweavers

2069 search results - page 253 / 414
» Linear time algorithms for Clobber
Sort
View
VLDB
1989
ACM
88views Database» more  VLDB 1989»
15 years 10 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
CCCG
1998
15 years 7 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 6 months ago
Asynchronous Distributed Searchlight Scheduling
Abstract— This paper develops and compares two asynchronous distributed scheduling algorithms for multiple controlled searchlights in nonconvex polygonal environments. A searchli...
Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 11 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICCV
2009
IEEE
2171views Computer Vision» more  ICCV 2009»
16 years 10 months ago
Fast Visibility Restoration from a Single Color or Gray Level Image
One source of difficulties when processing outdoor images is the presence of haze, fog or smoke which fades the colors and reduces the contrast of the observed objects. We introdu...
Jean-Philippe Tarel and Nicolas Hautière