Sciweavers

613 search results - page 85 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
15 years 5 months ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 3 days ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
VLDB
2007
ACM
103views Database» more  VLDB 2007»
16 years 21 hour ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ICCV
2003
IEEE
16 years 1 months ago
A Class of Photometric Invariants: Separating Material from Shape and Illumination
We derive a new class of photometric invariants that can be used for a variety of vision tasks including lighting invariant material segmentation, change detection and tracking, a...
Srinivasa G. Narasimhan, Visvanathan Ramesh, Shree...
MFCS
2010
Springer
14 years 10 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...