Sciweavers

3110 search results - page 424 / 622
» On the initialization of the DNMF algorithm
Sort
View
WABI
2004
Springer
116views Bioinformatics» more  WABI 2004»
15 years 12 months ago
Topological Rearrangements and Local Search Method for Tandem Duplication Trees
—The problem of reconstructing the duplication history of a set of tandemly repeated sequences was first introduced by Fitch [4]. Many recent studies deal with this problem, show...
Denis Bertrand, Olivier Gascuel
WDAG
2004
Springer
144views Algorithms» more  WDAG 2004»
15 years 12 months ago
Contention-Free MAC Protocols for Wireless Sensor Networks
Abstract. A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and c...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
ICRA
2003
IEEE
154views Robotics» more  ICRA 2003»
15 years 11 months ago
Automated multisensor polyhedral model acquisition
Abstract—We describe a method for automatically generating accurate piecewise planar models of indoor scenes using a combination of a 2D laser scanner and a camera on a mobile pl...
Diego Ortin, J. M. M. Montiel, Andrew Zisserman
ICSM
2003
IEEE
15 years 11 months ago
Library Miniaturization Using Static and Dynamic Information
Moving to smaller libraries can be considered as a relevant task when porting software systems to limited-resource devices (e.g., hand-helds). Library miniaturization will be part...
Giuliano Antoniol, Massimiliano Di Penta
ICTAI
2003
IEEE
15 years 11 months ago
Eliminating Redundancies in SAT Search Trees
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...
Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, ...