Sciweavers

13603 search results - page 2546 / 2721
» On the Complexity of Computing Treelength
Sort
View
SAC
2003
ACM
15 years 11 months ago
TinyGALS: A Programming Model for Event-Driven Embedded Systems
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...
Elaine Cheong, Judith Liebman, Jie Liu, Feng Zhao
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
SIGGRAPH
2003
ACM
15 years 11 months ago
Animating art history: building a bridge between disciplines
The study of art history is an exciting and rewarding one, but one in which the student frequently encounters complex and difficult to understand concepts. Traditional methodologi...
LiQin Tan, Roberta K. Tarbell, Robert Wuilfe
SMA
2003
ACM
169views Solid Modeling» more  SMA 2003»
15 years 11 months ago
Surface reconstruction of freeform objects based on multiresolution volumetric method
3D scanners developed over the past several decades have facilitated the reconstruction of complicated engineering parts. Typically the boundary representation of a part is recons...
Sergei Azernikov, Alex Miropolsky, Anath Fischer
SPAA
2003
ACM
15 years 11 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
« Prev « First page 2546 / 2721 Last » Next »