Sciweavers

783 search results - page 55 / 157
» Improved approximation algorithms for the freeze-tag problem
Sort
View
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 10 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...
ICML
2009
IEEE
14 years 9 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....
STACS
2005
Springer
14 years 2 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
TNN
1998
89views more  TNN 1998»
13 years 8 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 8 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula