Sciweavers

1814 search results - page 213 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
16 years 3 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
CVPR
2011
IEEE
15 years 2 months ago
Learning Object Color Models from Multi-view Constraints
Color is known to be highly discriminative for many object recognition tasks, but is difficult to infer from uncontrolled images in which the illuminant is not known. Traditional...
Trevor Owens, Kate Saenko, Trevor Darrell, Ayan Ch...
PLDI
1994
ACM
15 years 10 months ago
Memory Access Coalescing: A technique for Eliminating Redundant memory Accesses
As microprocessor speeds increase, memory bandwidth is increasing y the performance bottleneck for microprocessors. This has occurred because innovation and technological improvem...
Jack W. Davidson, Sanjay Jinturkar
ICPR
2004
IEEE
16 years 7 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
16 years 1 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...