Sciweavers

5595 search results - page 419 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 8 months ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...
DAM
2008
131views more  DAM 2008»
15 years 7 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
FLAIRS
2009
15 years 4 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
ICML
2009
IEEE
16 years 7 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
ICRA
2006
IEEE
95views Robotics» more  ICRA 2006»
16 years 26 days ago
Discrete Approximations to Continuous Curves
Abstract— We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking...
Sean B. Andersson