Sciweavers

1693 search results - page 115 / 339
» fast 2008
Sort
View
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 9 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
HPCA
2008
IEEE
14 years 9 months ago
System level analysis of fast, per-core DVFS using on-chip switching regulators
Portable, embedded systems place ever-increasing demands on high-performance, low-power microprocessor design. Dynamic voltage and frequency scaling (DVFS) is a well-known techniq...
Wonyoung Kim, Meeta Sharma Gupta, Gu-Yeon Wei, Dav...
EDBT
2008
ACM
151views Database» more  EDBT 2008»
14 years 9 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura
BIBM
2008
IEEE
112views Bioinformatics» more  BIBM 2008»
14 years 3 months ago
Fast Alignments of Metabolic Networks
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
Qiong Cheng, Piotr Berman, Robert W. Harrison, Ale...
CGO
2008
IEEE
14 years 3 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...