Sciweavers

427 search results - page 19 / 86
» Computing the Local Consensus of Trees
Sort
View
CVPR
2006
IEEE
15 years 11 months ago
Scalable Recognition with a Vocabulary Tree
A recognition scheme that scales efficiently to a large number of objects is presented. The efficiency and quality is exhibited in a live demonstration that recognizes CD-covers...
David Nistér, Henrik Stewénius
LISA
2001
15 years 6 months ago
TemplateTree II: The Post-Installation Setup Tool
After installing an OS distribution, a computer is generally not yet properly adapted to go into production at the local site. Security policies must be implemented, local service...
Tobias Oetiker
ICPP
1987
IEEE
15 years 8 months ago
Parallel Algorithm for Maximum Weight Matching in Trees
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees ...
Shaunak Pawagi
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 9 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
TSP
2010
14 years 11 months ago
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Abstract--This paper develops an optimal decentralized algorithm for sparse signal recovery and demonstrates its application in monitoring localized phenomena using energy-constrai...
Qing Ling, Zhi Tian