Sciweavers

5410 search results - page 995 / 1082
» When to Cross Over
Sort
View
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
14 years 2 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
14 years 2 months ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
VLDB
2000
ACM
133views Database» more  VLDB 2000»
14 years 2 months ago
Memex: A Browsing Assistant for Collaborative Archiving and Mining of Surf Trails
Keyword indices, topic directories, and link-based rankings are used to search and structure the rapidly growing Web today. Surprisingly little use is made of years of browsing ex...
Soumen Chakrabarti, Sandeep Srivastava, Mallela Su...
VLDB
2000
ACM
155views Database» more  VLDB 2000»
14 years 2 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
ISCA
1995
IEEE
110views Hardware» more  ISCA 1995»
14 years 2 months ago
Optimization of Instruction Fetch Mechanisms for High Issue Rates
Recent superscalar processors issue four instructions per cycle. These processors are also powered by highly-parallel superscalar cores. The potential performance can only be expl...
Thomas M. Conte, Kishore N. Menezes, Patrick M. Mi...