202 search results - page 32 / 41 » A more efficient approximation scheme for tree alignment |
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
ICRA
1999
IEEE
13 years 12 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
JIDM
2010
13 years 6 months ago
2010
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
TWC
2008
13 years 7 months ago
2008
Conventional hybrid automatic retransmission request (HARQ) is usually used to maximize throughput. However, high throughput is achieved at the expense of high latency. We study a...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...