Sciweavers

13987 search results - page 409 / 2798
» The Two Guards Problem
Sort
View
MFCS
2007
Springer
16 years 1 months ago
Minimizing Variants of Visibly Pushdown Automata
The minimization problem for visibly pushdown automata (VPA) is studied. Two subclasses of VPA are introduced: call driven automata, and block automata. For the first class, minim...
Patrick Chervet, Igor Walukiewicz
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
16 years 28 days ago
Minimum Enclosing Spheres Formulations for Support Vector Ordinal Regression
We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. B...
Shirish Krishnaj Shevade, Wei Chu
RTAS
2006
IEEE
16 years 27 days ago
Task Partitioning with Replication upon Heterogeneous Multiprocessor Systems
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
Sathish Gopalakrishnan, Marco Caccamo
ICRA
2005
IEEE
123views Robotics» more  ICRA 2005»
16 years 14 days ago
SLAM via Variable Reduction from Constraint Maps
- The two dominant forms of SLAM are based on Extended Kalman Filtering and Consistent Pose Estimation. We show that these are particular subsets of a more general view of the SLAM...
Kurt Konolige
ICCS
2005
Springer
16 years 12 days ago
Disjoint Segments with Maximum Density
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang