Sciweavers

4342 search results - page 507 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ICCV
2003
IEEE
16 years 8 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...
APLAS
2006
ACM
15 years 10 months ago
A Localized Tracing Scheme Applied to Garbage Collection
We present a method to visit all nodes in a forest of data structures while taking into account object placement. We call the technique a Localized Tracing Scheme as it improves lo...
Yannis Chicha, Stephen M. Watt
CAAN
2006
Springer
15 years 10 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
Boris Goldengorin, Gerold Jäger, Paul Molitor
204
Voted
ISVC
2009
Springer
16 years 1 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House