510 search results - page 85 / 102 » Searching Solitaire in Real Time |
KDD
1998
ACM
15 years 4 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
113
click to vote
ICS
1993
Tsinghua U.
15 years 3 months ago
1993
Tsinghua U.
Performance monitoring of large scale parallel computers creates a dilemma: we need to collect detailed information to find performance bottlenecks, yet collecting all this data ...
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
EWCBR
2004
Springer
15 years 3 months ago
2004
Springer
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
ICMCS
1995
IEEE
15 years 3 months ago
1995
IEEE
This paper presents a framework for data modeling ntic abstraction of image/video data. The framework is based on spatio-temporalinformation associated with salient objects in an ...