Sciweavers

9359 search results - page 117 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 6 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
16 years 4 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ECAI
2000
Springer
15 years 8 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
GECCO
2006
Springer
214views Optimization» more  GECCO 2006»
15 years 7 months ago
A new discrete particle swarm algorithm applied to attribute selection in a bioinformatics data set
Many data mining applications involve the task of building a model for predictive classification. The goal of such a model is to classify examples (records or data instances) into...
Elon S. Correa, Alex Alves Freitas, Colin G. Johns...
COMPGEOM
2005
ACM
15 years 6 months ago
Star splaying: an algorithm for repairing delaunay triangulations and convex hulls
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
Jonathan Richard Shewchuk