Sciweavers

1389 search results - page 165 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
WINE
2007
Springer
166views Economy» more  WINE 2007»
15 years 9 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
140
Voted
DCG
2008
86views more  DCG 2008»
15 years 3 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
ALENEX
2008
180views Algorithms» more  ALENEX 2008»
15 years 4 months ago
Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing
The National Airspace System (NAS) is designed to accommodate a large number of flights over North America. For purposes of workload limitations for air traffic controllers, the a...
Amitabh Basu, Joseph S. B. Mitchell, Girishkumar S...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 6 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
ICASSP
2009
IEEE
15 years 10 months ago
Formant-based technique for automatic filled-pause detection in spontaneous spoken english
Detection of filled pauses is a challenging research problem which has several practical applications. It can be used to evaluate the spoken fluency skills of the speaker, to im...
Kartik Audhkhasi, Kundan Kandhway, Om Deshmukh, As...