Sciweavers

74 search results - page 11 / 15
» Trapezoid Graphs and Generalizations, Geometry and Algorithm...
Sort
View
SPAA
2004
ACM
14 years 4 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 10 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
INFOCOM
2007
IEEE
14 years 1 months ago
A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks
— Broadcast protocols play a vital role in multihop wireless networks. Due to the broadcast nature of radio signals, a node’s interference range can be larger than its transmis...
Zhenming Chen, Chunming Qiao, Jinhui Xu, Taekkyeun...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 11 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
MM
2006
ACM
119views Multimedia» more  MM 2006»
14 years 20 days ago
Model generation for video-based object recognition
This paper presents a novel approach to object recognition involving a sparse 2D model and matching using video. The model is generated on the basis of geometry and image measurab...
Humera Noor, Shahid H. Mirza, Yaser Sheikh, Amit J...