Sciweavers

Share
ICCBR
2009
Springer
9 years 6 months ago
An Active Approach to Automatic Case Generation
Abstract. When learning by observing an expert, cases can be automatically generated in an inexpensive manner. However, since this is a passive method of learning the observer has ...
Michael W. Floyd, Babak Esfandiari
FSTTCS
2009
Springer
9 years 6 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
9 years 6 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
ATAL
2009
Springer
9 years 6 months ago
Achieving goals in decentralized POMDPs
Coordination of multiple agents under uncertainty in the decentralized POMDP model is known to be NEXP-complete, even when the agents have a joint set of goals. Nevertheless, we s...
Christopher Amato, Shlomo Zilberstein
WG
2009
Springer
9 years 6 months ago
The Parameterized Complexity of Some Minimum Label Problems
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
9 years 6 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
9 years 6 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
CCECE
2009
IEEE
9 years 6 months ago
Estimation of boundary properties using stochastic differential equations
The inverse diffusion problems deal with the estimation of many crucial parameters such as the diffusion coefficient, source properties, and boundary conditions. Such algorithms ...
Ashraf Atalla, Aleksandar Jeremic
ICML
2009
IEEE
9 years 6 months ago
Topic-link LDA: joint models of topic and author community
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot o...
Yan Liu, Alexandru Niculescu-Mizil, Wojciech Gryc
books