Sciweavers

7930 search results - page 89 / 1586
» Greedy in Approximation Algorithms
Sort
View

Publication
210views
16 years 1 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
NETWORKING
2007
15 years 7 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
CORR
2008
Springer
178views Education» more  CORR 2008»
15 years 6 months ago
Model-Based Compressive Sensing
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
Richard G. Baraniuk, Volkan Cevher, Marco F. Duart...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
15 years 3 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...
IPL
2006
151views more  IPL 2006»
15 years 6 months ago
Approximating weighted matchings in parallel
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Stefan Hougardy, Doratha E. Drake Vinkemeier