Sciweavers

161 search results - page 11 / 33
» Setting port numbers for fast graph exploration
Sort
View
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
TVLSI
2008
116views more  TVLSI 2008»
13 years 7 months ago
Fast Substrate Noise Aware Floorplanning for Mixed Signal SOC Designs
Abstract--In this paper, we introduce a novel substrate noise estimation technique during early floorplanning for mixed signal system-on-chip (SOC), based on block preference direc...
Minsik Cho, David Z. Pan
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 1 months ago
A Fast and Adaptive Test of Static Equilibrium for Legged Robots
— A legged robot walking on uneven terrain can avoid falling only by applying contact forces with its feet on the ground that compensate for gravity without causing slip. To plan...
Timothy Bretl, Sanjay Lall
MFCS
2010
Springer
13 years 6 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...
CVPR
2008
IEEE
14 years 9 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona