Sciweavers

2084 search results - page 378 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
EOR
2007
101views more  EOR 2007»
14 years 9 months ago
Optimizing an objective function under a bivariate probability model
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Xavier Brusset, Nico M. Temme
175
Voted
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
15 years 11 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
IPPS
2010
IEEE
14 years 7 months ago
Solving the advection PDE on the cell broadband engine
In this paper we present the venture of porting two different algorithms for solving the two-dimensional advection PDE on the CBE platform, an in-place and an outof-place one, and ...
Georgios Rokos, Gerassimos Peteinatos, Georgia Kou...
SPAA
1997
ACM
15 years 1 months ago
Efficient Detection of Determinacy Races in Cilk Programs
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
Mingdong Feng, Charles E. Leiserson
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani