Sciweavers

51 search results - page 10 / 11
» Phase Transitions for Greedy Sparse Approximation Algorithms
Sort
View
ICRA
2006
IEEE
165views Robotics» more  ICRA 2006»
14 years 9 days ago
Biped Gait Optimization using Spline Function based Probability Model
— A new Estimation of Distribution Algorithm (EDA) with spline kernel function (EDA_S) is proposed to optimize biped gait for a nine-link humanoid robot. Gait synthesis of the bi...
Lingyun Hu, Changjiu Zhou, Zengqi Sun
PR
2008
170views more  PR 2008»
13 years 5 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
IPPS
2008
IEEE
14 years 20 days ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 6 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
ICPR
2002
IEEE
13 years 11 months ago
Feasibility of Hough-Transform-Based Iris Localisation for Real-Time-Application
We present a fast method for locating iris features in frontal face images based on the Hough transform. It consists of an initial iris detection step and a tracking step which us...
Klaus D. Tönnies, Frank Behrens, Melanie Aurn...