4085 search results - page 749 / 817 » Benchmarking Data Mining Algorithms |
91
Voted
RECOMB
2004
Springer
16 years 28 days ago
2004
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
95
Voted
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
106
click to vote
IUI
2009
ACM
15 years 9 months ago
2009
ACM
Knowledge workers must manage large numbers of simultaneous, ongoing projects that collectively involve huge numbers of resources (documents, emails, web pages, calendar items, et...
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
One of the biggest challenges in non-rigid shape retrieval and comparison is the design of a shape descriptor that would maintain invariance under a wide class of transformations ...
100
Voted
ICS
2009
Tsinghua U.
15 years 7 months ago
2009
Tsinghua U.
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...