Sciweavers

7228 search results - page 754 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
WSDM
2012
ACM
290views Data Mining» more  WSDM 2012»
14 years 3 months ago
Online selection of diverse results
The phenomenal growth in the volume of easily accessible information via various web-based services has made it essential for service providers to provide users with personalized ...
Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwa...
ANCS
2005
ACM
16 years 1 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood
ATAL
2010
Springer
15 years 7 months ago
Local search for distributed asymmetric optimization
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
Alon Grubshtein, Roie Zivan, Tal Grinshpoun, Amnon...