Sciweavers

2107 search results - page 22 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
SENSYS
2005
ACM
14 years 1 months ago
CenWits: a sensor-based loosely coupled search and rescue system using witnesses
This paper describes the design, implementation and evaluation of a search and rescue system called CenWits. CenWits uses several small, commonly-available RF-based sensors, and a...
Jyh-How Huang, Saqib Amjad, Shivakant Mishra
FOCS
2004
IEEE
13 years 11 months ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
14 years 1 months ago
Near-Optimal Pricing in Near-Linear Time
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
Jason D. Hartline, Vladlen Koltun
BMCBI
2007
157views more  BMCBI 2007»
13 years 7 months ago
Statistical learning of peptide retention behavior in chromatographic separations: a new kernel-based approach for computational
Background: High-throughput peptide and protein identification technologies have benefited tremendously from strategies based on tandem mass spectrometry (MS/MS) in combination wi...
Nico Pfeifer, Andreas Leinenbach, Christian G. Hub...