2434 search results - page 357 / 487 » Algorithmic Randomness of Closed Sets |
134
Voted
IUI
2004
ACM
15 years 9 months ago
2004
ACM
Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applicatio...
134
Voted
PODC
2010
ACM
15 years 7 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
135
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
150
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
133
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...