Sciweavers

1964 search results - page 240 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ML
2006
ACM
13 years 8 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
VLDB
2007
ACM
115views Database» more  VLDB 2007»
14 years 2 months ago
The Boundary Between Privacy and Utility in Data Publishing
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
Vibhor Rastogi, Sungho Hong, Dan Suciu
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
14 years 2 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
13 years 11 months ago
Tracking multiple objects in non-stationary video
One of the key problems in computer vision and pattern recognition is tracking. Multiple objects, occlusion, and tracking moving objects using a moving camera are some of the chal...
Hoang Nguyen, Bir Bhanu
WWW
2007
ACM
14 years 9 months ago
Csurf: a context-driven non-visual web-browser
Web sites are designed for graphical mode of interaction. Sighted users can "cut to the chase" and quickly identify relevant information in Web pages. On the contrary, i...
Jalal Mahmud, Yevgen Borodin, I. V. Ramakrishnan