Sciweavers

1871 search results - page 312 / 375
» The Ephemeral Pairing Problem
Sort
View
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 10 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
COMPGEOM
2008
ACM
15 years 8 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
15 years 7 months ago
On-Line Difference Maximization
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
Ming-Yang Kao, Stephen R. Tate
BMCBI
2010
86views more  BMCBI 2010»
15 years 6 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
BMCBI
2007
142views more  BMCBI 2007»
15 years 6 months ago
Improving model construction of profile HMMs for remote homology detection through structural alignment
Background: Remote homology detection is a challenging problem in Bioinformatics. Arguably, profile Hidden Markov Models (pHMMs) are one of the most successful approaches in addre...
Juliana S. Bernardes, Alberto M. R. Dávila,...