Sciweavers

3229 search results - page 599 / 646
» The Theory of Timed Automata
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
GRAPHITE
2006
ACM
14 years 1 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
MOBICOM
2006
ACM
14 years 1 months ago
Long-distance 802.11b links: performance measurements and experience
The use of 802.11 long-distance links is a cost-effective means of providing wireless connectivity to rural areas. Although deployments in this setting are increasing, a systemat...
Kameswari Chebrolu, Bhaskaran Raman, Sayandeep Sen
MOBIHOC
2006
ACM
14 years 1 months ago
Wakeup scheduling in wireless sensor networks
A large number of practical sensing and actuating applications require immediate notification of rare but urgent events and also fast delivery of time sensitive actuation command...
Abtin Keshavarzian, Huang Lee, Lakshmi Venkatraman
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer