Sciweavers

2370 search results - page 104 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 3 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
BMCBI
2008
99views more  BMCBI 2008»
14 years 10 months ago
Multiple organism algorithm for finding ultraconserved elements
Background: Ultraconserved elements are nucleotide or protein sequences with 100% identity (no mismatches, insertions, or deletions) in the same organism or between two or more or...
Scott Christley, Neil F. Lobo, Gregory R. Madey
WCNC
2008
IEEE
15 years 4 months ago
On the Distribution of Positioning Errors in Wireless Sensor Networks: A Simulative Comparison of Optimization Algorithms
Abstract—Recent advances in the technology of wireless electronic devices have made possible to build ad–hoc Wireless Sensor Networks (WSNs) using inexpensive nodes consisting ...
Stefano Tennina, Marco Di Renzo, Fortunato Santucc...
CORR
2000
Springer
116views Education» more  CORR 2000»
14 years 9 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
COCOON
2009
Springer
15 years 4 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch