Sciweavers

372 search results - page 63 / 75
» On Finding Small 2-Generating Sets
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 10 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
IUI
2009
ACM
14 years 6 months ago
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...
Melinda T. Gervasio, Janet L. Murdock
COMPGEOM
2007
ACM
14 years 1 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 1 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
KDD
2010
ACM
188views Data Mining» more  KDD 2010»
13 years 11 months ago
Inferring networks of diffusion and influence
Information diffusion and virus propagation are fundamental processes talking place in networks. While it is often possible to directly observe when nodes become infected, observi...
Manuel Gomez-Rodriguez, Jure Leskovec, Andreas Kra...