Sciweavers

1272 search results - page 189 / 255
» The Set Cover with Pairs Problem
Sort
View
TCS
2008
13 years 10 months ago
Kernel methods for learning languages
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
ICRA
2007
IEEE
189views Robotics» more  ICRA 2007»
14 years 4 months ago
Stereo-based Markerless Human Motion Capture for Humanoid Robot Systems
Abstract— In this paper, we present an image-based markerless human motion capture system, intended for humanoid robot systems. The restrictions set by this ambitious goal are nu...
Pedram Azad, Ales Ude, Tamim Asfour, Rüdiger ...
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 10 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
MP
1998
136views more  MP 1998»
13 years 10 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
IWPEC
2009
Springer
14 years 4 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...