Sciweavers

3105 search results - page 592 / 621
» The Path-Packing Structure of Graphs
Sort
View
DIMACS
1996
15 years 1 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
122
Voted
ALGORITHMICA
2011
14 years 7 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
ICCV
2003
IEEE
16 years 2 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
ECCV
2008
Springer
16 years 2 months ago
Learning Visual Shape Lexicon for Document Image Content Recognition
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...
Guangyu Zhu, Xiaodong Yu, Yi Li, David S. Doermann
191
Voted
GIS
2009
ACM
16 years 1 months ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...