Sciweavers

4411 search results - page 622 / 883
» Communication Complexity and Its Applications
Sort
View
COLT
2007
Springer
16 years 24 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
EPEW
2007
Springer
16 years 24 days ago
Towards an Automatic Modeling Tool for Observed System Behavior
Current computer systems and communication networks tend to be highly complex, and they typically hide their internal structure from their users. Thus, for selected aspects of capa...
Thomas Begin, Alexandre Brandwajn, Bruno Baynat, B...
IPSN
2007
Springer
16 years 23 days ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
MDM
2007
Springer
209views Communications» more  MDM 2007»
16 years 23 days ago
Parallelized Simulated Annealing for Model Updating in Ad-Hoc Wireless Sensing Networks
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...
Andrew T. Zimmerman, Jerome P. Lynch
ACSC
2006
IEEE
16 years 21 days ago
Interaction design for a mobile context-aware system using discrete event modelling
This paper describes our experience when applying formal methods in the design of the tourist information system TIP, which presents context-sensitive information to mobile users ...
Annika Hinze, Petra Malik, Robi Malik