4066 search results - page 137 / 814 » Almost Complete Sets |
139
click to vote
ISSAC
2001
Springer
15 years 11 months ago
2001
Springer
Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safet...
174
click to vote
ISAAC
2009
Springer
16 years 29 days ago
2009
Springer
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
154
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
We consider the problem of online sublinear expander reconstruction and its relation to random walks in “noisy” expanders. Given access to an adjacency list representation of ...
137
click to vote
DASFAA
2007
IEEE
16 years 22 days ago
2007
IEEE
In many online shopping applications, traditional Association Rule (AR) mining has limitations as it only deals with the items that are sold but ignores the items that are almost s...
170
click to vote
ISAAC
2005
Springer
15 years 12 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...