Sciweavers

5995 search results - page 1107 / 1199
» Algorithmic Game Theory
Sort
View
ICMI
2007
Springer
199views Biometrics» more  ICMI 2007»
15 years 7 months ago
Interest estimation based on dynamic bayesian networks for visual attentive presentation agents
In this paper, we describe an interface consisting of a virtual showroom where a team of two highly realistic 3D agents presents product items in an entertaining and attractive wa...
Boris Brandherm, Helmut Prendinger, Mitsuru Ishizu...
IPSN
2007
Springer
15 years 7 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
IEEEPACT
2006
IEEE
15 years 7 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...
159
Voted
WIOPT
2006
IEEE
15 years 7 months ago
Scheduling sensor activity for point information coverage in wireless sensor networks
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
Bang Wang, Kee Chaing Chua, Vikram Srinivasan, Wei...
CASES
2006
ACM
15 years 7 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
« Prev « First page 1107 / 1199 Last » Next »