4860 search results - page 503 / 972 » SNPs Problems, Complexity, and Algorithms |
110
click to vote
ICDT
2001
ACM
15 years 8 months ago
2001
ACM
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
125
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
133
click to vote
CHARME
1997
Springer
15 years 7 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
140
click to vote
AAAI
2006
15 years 5 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
134
click to vote
IJCAI
2003
15 years 5 months ago
2003
We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate ...