Sciweavers

4850 search results - page 773 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
2006
ACM
139views Data Mining» more  KDD 2006»
16 years 5 months ago
Generating semantic annotations for frequent patterns with context analysis
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, Che...
ISCA
2009
IEEE
146views Hardware» more  ISCA 2009»
15 years 11 months ago
Multi-execution: multicore caching for data-similar executions
While microprocessor designers turn to multicore architectures to sustain performance expectations, the dramatic increase in parallelism of such architectures will put substantial...
Susmit Biswas, Diana Franklin, Alan Savage, Ryan D...
PPOPP
2006
ACM
15 years 10 months ago
Exploiting distributed version concurrency in a transactional memory cluster
We investigate a transactional memory runtime system providing scaling and strong consistency for generic C++ and SQL applications on commodity clusters. We introduce a novel page...
Kaloian Manassiev, Madalin Mihailescu, Cristiana A...
WWW
2005
ACM
16 years 5 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
CISS
2008
IEEE
15 years 11 months ago
Sparsity in MRI RF excitation pulse design
—Magnetic resonance imaging (MRI) may be viewed as a two-stage experiment that yields a non-invasive spatial mapping of hydrogen nuclei in living subjects. Nuclear spins within a...
Adam C. Zelinski, Vivek K. Goyal, Elfar Adalsteins...