Sciweavers

259 search results - page 16 / 52
» Graph Distances in the Data-Stream Model
Sort
View
CVPR
2007
IEEE
14 years 2 months ago
Conformal Embedding Analysis with Local Graph Modeling on the Unit Hypersphere
We present the Conformal Embedding Analysis (CEA) for feature extraction and dimensionality reduction. Incorporating both conformal mapping and discriminating analysis, CEA projec...
Yun Fu, Ming Liu, Thomas S. Huang
IVC
2007
173views more  IVC 2007»
13 years 7 months ago
Outdoor recognition at a distance by fusing gait and face
We explore the possibility of using both face and gait in enhancing human recognition at a distance performance in outdoor conditions. Although the individual performance of gait ...
Zongyi Liu, Sudeep Sarkar
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
13 years 12 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 9 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
SIROCCO
2008
13 years 9 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker