Sciweavers

1538 search results - page 212 / 308
» Relative Randomness and Cardinality
Sort
View
CHI
2005
ACM
15 years 10 months ago
Using context-aware computing to reduce the perceived burden of interruptions from mobile devices
The potential for sensor-enabled mobile devices to proactively present information when and where users need it ranks among the greatest promises of ubiquitous computing. Unfortun...
Joyce Ho, Stephen S. Intille
VLSID
2008
IEEE
117views VLSI» more  VLSID 2008»
15 years 10 months ago
Single Event Upset: An Embedded Tutorial
Abstract-- With the continuous downscaling of CMOS technologies, the reliability has become a major bottleneck in the evolution of the next generation systems. Technology trends su...
Fan Wang, Vishwani D. Agrawal
STOC
2005
ACM
174views Algorithms» more  STOC 2005»
15 years 10 months ago
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
Abraham Flaxman, Alan M. Frieze, Juan Carlos Vera
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 10 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
15 years 10 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...