Sciweavers

779 search results - page 50 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 10 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
WACV
2002
IEEE
15 years 9 months ago
Appearance-based Eye Gaze Estimation
We present a method for estimating eye gaze direction, which represents a departure from conventional eye gaze estimation methods, the majority of which are based on tracking spec...
Kar-Han Tan, David J. Kriegman, Narendra Ahuja
TSMC
2002
110views more  TSMC 2002»
15 years 4 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
COMPGEOM
2011
ACM
14 years 8 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
JCO
2006
126views more  JCO 2006»
15 years 4 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li