Sciweavers

775 search results - page 119 / 155
» Algorithm Selection via Ranking
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 2 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
3DIM
2007
IEEE
14 years 3 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
WAOA
2005
Springer
152views Algorithms» more  WAOA 2005»
14 years 2 months ago
Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. ...
CIKM
2008
Springer
13 years 10 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
ICIAP
2001
Springer
14 years 8 months ago
Recognition of Shape-Changing Hand Gestures Based on Switching Linear Model
We present a method to track and recognize shape-changing hand gestures simultaneously. The switching linear model using active contour model well corresponds to temporal shapes a...
Mun Ho Jeong, Yoshinori Kuno, Nobutaka Shimada, Yo...