Sciweavers

962 search results - page 176 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
WINET
2002
144views more  WINET 2002»
14 years 9 months ago
Exposure in Wireless Sensor Networks: Theory and Practical Solutions
Wireless ad-hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This conne...
Seapahn Megerian, Farinaz Koushanfar, Gang Qu, Gia...
87
Voted
MM
2010
ACM
158views Multimedia» more  MM 2010»
14 years 7 months ago
Image segmentation with patch-pair density priors
In this paper, we investigate how an unlabeled image corpus can facilitate the segmentation of any given image. A simple yet efficient multi-task joint sparse representation model...
Xiaobai Liu, Jiashi Feng, Shuicheng Yan, Hai Jin
WAOA
2010
Springer
236views Algorithms» more  WAOA 2010»
14 years 7 months ago
The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers
We study an extension of the unit-demand pricing problem in which the seller may offer bundles of items. If a customer buys such a bundle she is guaranteed to get one item out of i...
Patrick Briest, Heiko Röglin
MST
2010
146views more  MST 2010»
14 years 4 months ago
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
We consider triply-nested loops of the type that occur in the standard Gaussian elimination algorithm, which we denote by GEP (or the Gaussian Elimination Paradigm). We present tw...
Rezaul Alam Chowdhury, Vijaya Ramachandran
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
15 years 10 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...