Sciweavers

1568 search results - page 97 / 314
» The problem of examination questions in algorithmics
Sort
View
LREC
2008
110views Education» more  LREC 2008»
15 years 5 months ago
Cost-Sensitive Learning in Answer Extraction
One problem of data-driven answer extraction in open-domain factoid question answering is that the class distribution of labeled training data is fairly imbalanced. This imbalance...
Michael Wiegand, Jochen L. Leidner, Dietrich Klako...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 11 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
IWPEC
2009
Springer
15 years 11 months ago
Stable Assignment with Couples: Parameterized Complexity and Local Search
We study the Hospitals/Residents with Couples problem, a variant of the classical Stable Marriage problem. This is the extension of the Hospitals/Residents problem where residents ...
Dániel Marx, Ildikó Schlotter
MOC
2011
14 years 11 months ago
An optimal adaptive mixed finite element method
Abstract. Various applications in uid dynamics and computational continuum mechanics motivate the development of reliable and ecient adaptive algorithms for mixed nite element m...
Carsten Carstensen, Hella Rabus
STOC
2006
ACM
112views Algorithms» more  STOC 2006»
16 years 4 months ago
A quasi-PTAS for unsplittable flow on line graphs
We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...