Sciweavers

6562 search results - page 940 / 1313
» Noetherianity and Combination Problems
Sort
View
MOBISYS
2007
ACM
16 years 7 months ago
Simplifying cyber foraging for mobile devices
Cyber foraging is the transient and opportunistic use of compute servers by mobile devices. The short market life of such devices makes rapid modification of applications for remo...
Rajesh Krishna Balan, Darren Gergle, Mahadev Satya...
MOBISYS
2005
ACM
16 years 7 months ago
DeltaCast: efficient file reconciliation in wireless broadcast systems
Recently, there has been an increasing interest in wireless broadcast systems as a means to enable scalable content delivery to large numbers of mobile users. However, gracefully ...
Julian Chesterfield, Pablo Rodriguez
MOBISYS
2004
ACM
16 years 7 months ago
An Architecture for Privacy-Sensitive Ubiquitous Computing
Privacy is the most often-cited criticism of ubiquitous computing, and may be the greatest barrier to its long-term success. However, developers currently have little support in d...
Jason I. Hong, James A. Landay
SODA
2010
ACM
160views Algorithms» more  SODA 2010»
16 years 5 months ago
Solving Simple Stochastic Tail Games
Stochastic games are a natural model for open reactive processes: one player represents the controller and his opponent represents a hostile environment. The evolution of the syste...
Hugo Gimbert, Florian Horn
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
16 years 4 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson