Sciweavers

4276 search results - page 749 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
126
Voted
SC
2004
ACM
15 years 9 months ago
Language and Compiler Support for Adaptive Applications
There exist many application classes for which the users have significant flexibility in the quality of output they desire. At the same time, there are other constraints, such a...
Wei Du, Gagan Agrawal
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
16 years 4 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
115
Voted
ICFP
2008
ACM
16 years 3 months ago
Implicitly-threaded parallelism in Manticore
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...
Matthew Fluet, Mike Rainey, John H. Reppy, Adam Sh...
137
Voted
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
132
Voted
FOCS
2006
IEEE
15 years 10 months ago
On the Compressibility of NP Instances and Cryptographic Applications
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
Danny Harnik, Moni Naor