Sciweavers

1722 search results - page 181 / 345
» On the sample mean of graphs
Sort
View
ICCAD
2007
IEEE
161views Hardware» more  ICCAD 2007»
16 years 3 months ago
Clustering based pruning for statistical criticality computation under process variations
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
Hushrav Mogal, Haifeng Qian, Sachin S. Sapatnekar,...
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
16 years 1 months ago
Potential field guide for humanoid multicontacts acyclic motion planning
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
Karim Bouyarmane, Adrien Escande, Florent Lamiraux...
ICPR
2008
IEEE
16 years 28 days ago
Pre-extracting method for SVM classification based on the non-parametric K-NN rule
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...
Deqiang Han, Chongzhao Han, Yi Yang, Yu Liu, Wenta...
ICDAR
2007
IEEE
16 years 24 days ago
A Shared Parts Model for Document Image Recognition
We address document image classification by visual appearance. An image is represented by a variable-length list of visually salient features. A hierarchical Bayesian network is ...
M. Das Gupta, P. Sarkar
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
16 years 16 days ago
A Practical Algorithm for Network Topology Inference
— When a network of robots or static sensors is emplaced in an environment, the spatial relationships between the sensing units must be inferred or computed for most key applicat...
Dimitri Marinakis, Gregory Dudek