5675 search results - page 1055 / 1135 » Exploiting Chaos for Computation |
114
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
116
click to vote
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
128
Voted
VLSID
2008
IEEE
16 years 1 months ago
2008
IEEE
Simultaneous Multi-Threading (SMT) processors are becoming popular because they exploit both instruction-level and threadlevel parallelism by issuing instructions from different t...
109
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
172
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Entity Resolution (ER) is the problem of identifying which records in a database refer to the same real-world entity. An exhaustive ER process involves computing the similarities b...