Sciweavers

12264 search results - page 272 / 2453
» An Analysis of the XSL Algorithm
Sort
View
COMPGEOM
2008
ACM
15 years 8 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
15 years 8 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
GECCO
2008
Springer
229views Optimization» more  GECCO 2008»
15 years 7 months ago
EIN-WUM: an AIS-based algorithm for web usage mining
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
Adel Torkaman Rahmani, B. Hoda Helmi
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 6 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella