Sciweavers

4110 search results - page 444 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
STOC
1996
ACM
92views Algorithms» more  STOC 1996»
15 years 11 months ago
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
Maria Luisa Bonet, Cynthia A. Phillips, Tandy Warn...
DCOSS
2006
Springer
15 years 10 months ago
Gappa: Gossip Based Multi-channel Reprogramming for Sensor Networks
Abstract. Reprogramming the sensor networks in place is an important and challenging problem. One way suggested for reprogramming is with the help of an UAV (Unmanned Ariel Vehicle...
Limin Wang, Sandeep S. Kulkarni
3DIM
2001
IEEE
15 years 10 months ago
Range Image Registration: A Software Platform and Empirical Evaluation
Building 3D models of real-world objects by assembling views taken by a range sensor promises to be a more efficient method than manually producing CAD drawings. In this technique...
Gerald Dalley, Patrick J. Flynn
BMVC
2002
15 years 9 months ago
Randomized RANSAC with T(d, d) test
Many computer vision algorithms include a robust estimation step where model parameters are computed from a data set containing a significant proportion of outliers. The RANSAC al...
Jiri Matas, Ondrej Chum
AAAI
2008
15 years 9 months ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos