Sciweavers

372 search results - page 3 / 75
» On Finding Small 2-Generating Sets
Sort
View
BMCBI
2010
144views more  BMCBI 2010»
13 years 5 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 5 months ago
Adaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Dev...
MOBIHOC
2002
ACM
14 years 5 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
ICPR
2000
IEEE
14 years 6 months ago
Face Reconstruction from a Small Number of Feature Points
This paper proposes a method for face reconstruction that makes use of only a small set of feature points. Faces can be modeled by forming linear combinations of prototypes of sha...
Bon-Woo Hwang, Seong-Whan Lee, Volker Blanz, Thoma...
PUC
2008
141views more  PUC 2008»
13 years 5 months ago
A calendar based Internet content pre-caching agent for small computing devices
We described in earlier publications the principles of a system where internet content would be pre-cached, based on contextual information obtained from a user's electronic ...
Andreas Komninos, Mark D. Dunlop