Sciweavers

870 search results - page 57 / 174
» Theoretical and experimental results on the goal-plan tree p...
Sort
View
NIPS
2004
14 years 11 months ago
Density Level Detection is Classification
We show that anomaly detection can be interpreted as a binary classification problem. Using this interpretation we propose a support vector machine (SVM) for anomaly detection. We...
Ingo Steinwart, Don R. Hush, Clint Scovel
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 1 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
ICRA
2006
IEEE
134views Robotics» more  ICRA 2006»
15 years 3 months ago
Multiresolution Approach for Motion Planning under Differential Constraints
Abstract— In this paper, we present an incremental, multiresolution motion planning algorithm designed for systems with differential constraints. Planning for these sytems is mor...
Stephen R. Lindemann, Steven M. LaValle
AAAI
2010
14 years 11 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
IWPEC
2010
Springer
14 years 7 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier