Sciweavers

10213 search results - page 1886 / 2043
» An Experimental Analysis of Parallel
Sort
View
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 3 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
82
Voted
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 3 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
SC
2009
ACM
15 years 2 months ago
GPU based sparse grid technique for solving multidimensional options pricing PDEs
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
Abhijeet Gaikwad, Ioane Muni Toke
ISCA
1998
IEEE
108views Hardware» more  ISCA 1998»
15 years 2 months ago
Pipeline Gating: Speculation Control for Energy Reduction
Branch prediction has enabled microprocessors to increase instruction level parallelism (ILP) by allowing programs to speculatively execute beyond control boundaries. Although spe...
Srilatha Manne, Artur Klauser, Dirk Grunwald
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 2 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
« Prev « First page 1886 / 2043 Last » Next »