Sciweavers

1332 search results - page 94 / 267
» Combinatorial Algorithms
Sort
View
MST
2006
96views more  MST 2006»
13 years 9 months ago
Juggling with Pattern Matching
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
Jean Cardinal, Steve Kremer, Stefan Langerman
ICASSP
2010
IEEE
13 years 9 months ago
Robust regression using sparse learning for high dimensional parameter estimation problems
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
Kaushik Mitra, Ashok Veeraraghavan, Rama Chellappa
CPM
1999
Springer
92views Combinatorics» more  CPM 1999»
14 years 1 months ago
Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
Serafim Batzoglou, Sorin Istrail
RAS
2007
103views more  RAS 2007»
13 years 8 months ago
A decomposition approach to multi-vehicle cooperative control
We use a decomposition approach to generate cooperative strategies for a class of multi-vehicle control problems. By introducing a set of tasks to be completed by the team of vehi...
Matthew G. Earl, Raffaello D'Andrea
ISSAC
1997
Springer
194views Mathematics» more  ISSAC 1997»
14 years 1 months ago
The Minimised Geometric Buchberger Algorithm: An Optimal Algebraic Algorithm for Integer Programming
IP problems characterise combinatorial optimisation problems where conventional numerical methods based on the hill-climbing technique can not be directly applied. Conventional me...
Qiang Li, Yike Guo, Tetsuo Ida, John Darlington