107 search results - page 7 / 22 » An incremental algorithm for computing ranked full disjuncti... |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
DAC
2009
ACM
15 years 4 months ago
2009
ACM
It is unknown how to include stochastic process variation into fast-multipole-method (FMM) for a full chip capacitance extraction. This paper presents a parallel FMM extraction us...
82
Voted
HPDC
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
106
click to vote
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Outlier mining is a major task in data analysis. Outliers are objects that highly deviate from regular objects in their local neighborhood. Density-based outlier ranking methods...
92
Voted
CLOUD
2010
ACM
15 years 2 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...