Sciweavers

3991 search results - page 569 / 799
» Bounding homogeneous models
Sort
View
EWSN
2009
Springer
14 years 9 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
CHI
2005
ACM
14 years 8 months ago
An empirical study of typing rates on mini-QWERTY keyboards
We present a longitudinal study of mini-QWERTY keyboard use, examining the learning rates of novice miniQWERTY users. The study consists of 20 twenty-minute typing sessions using ...
Edward Clarkson, James Clawson, Kent Lyons, Thad S...
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 8 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 8 months ago
Buffer overflow management in QoS switches
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
Alexander Kesselman, Zvi Lotker, Yishay Mansour, B...
DCC
2006
IEEE
14 years 8 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley