Sciweavers

5329 search results - page 359 / 1066
» The Weighted Majority Algorithm
Sort
View
ICDM
2007
IEEE
119views Data Mining» more  ICDM 2007»
16 years 1 months ago
Reducing UK-Means to K-Means
This paper proposes an optimisation to the UK-means algorithm, which generalises the k-means algorithm to handle objects whose locations are uncertain. The location of each object...
Sau Dan Lee, Ben Kao, Reynold Cheng
NIPS
1998
15 years 8 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 8 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
COMPSAC
2002
IEEE
15 years 11 months ago
Object Identification in Legacy Code as a Grouping Problem
Maintenance is undoubtedly the most effort-consuming activity in software production whereby the entropy of legacy systems (e.g., due to redundancies, poor modularity and lack of ...
Houari A. Sahraoui, Petko Valtchev, Idrissa Konkob...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 8 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su