Sciweavers

9818 search results - page 118 / 1964
» Much Support and More
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
16 years 6 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
IEEEPACT
2003
IEEE
15 years 11 months ago
Design Trade-Offs in High-Throughput Coherence Controllers
Recent research shows that the high occupancy of Coherence Controllers (CCs) is a major performance bottleneck in scalable shared-memory multiprocessors. In this paper, we propose...
Anthony-Trung Nguyen, Josep Torrellas
STACS
2001
Springer
15 years 10 months ago
Randomness, Computability, and Density
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
Rodney G. Downey, Denis R. Hirschfeldt, Andr&eacut...
ACMACE
2007
ACM
15 years 10 months ago
How to build a hard-to-use mouse
Computer games do not afford much physical activity and hence do not require significant energy expenditure, which can contribute to the prevalence of a sedentary lifestyle. A &qu...
Florian Mueller
MICRO
1991
IEEE
85views Hardware» more  MICRO 1991»
15 years 10 months ago
Comparing Static and Dynamic Code Scheduling for Multiple-Instruction-Issue Processors
This paper examines two alternative approaches to supporting code scheduling for multiple-instruction-issue processors. One is to provide a set of non-trapping instructions so tha...
Pohua P. Chang, William Y. Chen, Scott A. Mahlke, ...