Sciweavers

243 search results - page 43 / 49
» An optimal local approximation algorithm for max-min linear ...
Sort
View
MP
2002
101views more  MP 2002»
13 years 6 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 8 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
KDD
2009
ACM
209views Data Mining» more  KDD 2009»
14 years 7 months ago
Collective annotation of Wikipedia entities in web text
To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world...
Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, ...
PLDI
2005
ACM
14 years 19 days ago
Formal loop merging for signal transforms
A critical optimization in the domain of linear signal transforms, such as the discrete Fourier transform (DFT), is loop merging, which increases data locality and reuse and thus ...
Franz Franchetti, Yevgen Voronenko, Markus Pü...