Sciweavers

ACID
2006
220views Algorithms» more  ACID 2006»
13 years 11 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
ACID
2006
352views Algorithms» more  ACID 2006»
13 years 11 months ago
Matrix Robustness, with an Application to Power System Observability
Matthias Brosemann, Jochen Alber, Falk Hüffne...
ACID
2006
236views Algorithms» more  ACID 2006»
13 years 11 months ago
Kernelization for Convex Recoloring
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
Hans L. Bodlaender, Michael R. Fellows, Michael A....
AAAI
2006
13 years 11 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
AAAI
2006
13 years 11 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...
AAAI
2006
13 years 11 months ago
Efficient L1 Regularized Logistic Regression
L1 regularized logistic regression is now a workhorse of machine learning: it is widely used for many classification problems, particularly ones with many features. L1 regularized...
Su-In Lee, Honglak Lee, Pieter Abbeel, Andrew Y. N...
AAAI
2004
13 years 11 months ago
Low-Knowledge Algorithm Control
This paper addresses the question of allocating computational resources among a set of algorithms in order to achieve the best performance on a scheduling problem instance. Our pr...
Tom Carchrae, J. Christopher Beck
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 11 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon
SODA
2007
ACM
95views Algorithms» more  SODA 2007»
13 years 11 months ago
Dynamic pricing for impatient bidders
Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri R...