Sciweavers

6584 search results - page 1212 / 1317
» Distributed Shared Contexts
Sort
View
150
Voted
KDD
2007
ACM
193views Data Mining» more  KDD 2007»
16 years 3 months ago
Joint optimization of wrapper generation and template detection
Many websites have large collections of pages generated dynamically from an underlying structured source like a database. The data of a category are typically encoded into similar...
Shuyi Zheng, Ruihua Song, Ji-Rong Wen, Di Wu
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
16 years 3 months ago
Efficient anonymity-preserving data collection
The output of a data mining algorithm is only as good as its inputs, and individuals are often unwilling to provide accurate data about sensitive topics such as medical history an...
Justin Brickell, Vitaly Shmatikov
149
Voted
HPCA
2008
IEEE
16 years 3 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...
137
Voted
RECOMB
2004
Springer
16 years 3 months ago
Designing multiple simultaneous seeds for DNA similarity search
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
Yanni Sun, Jeremy Buhler
138
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 3 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
« Prev « First page 1212 / 1317 Last » Next »