Sciweavers

27692 search results - page 119 / 5539
» Where is ...
Sort
View
TAMC
2009
Springer
14 years 3 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
ACMACE
2009
ACM
14 years 3 months ago
Instantaneous saccade driven eye gaze interaction
In this paper, we introduce and evaluate a new Instantaneous Saccade (IS) selection scheme for eye gaze driven interfaces where the speed of the target selection is of utmost impo...
Oleg V. Komogortsev, Young Sam Ryu, Do Hyong Koh, ...
SIGCOMM
2009
ACM
14 years 3 months ago
Opportunistic forwarding in workplaces
So far, the search for Opportunistic Network (ON) applications has focused on urban/rural scenarios where the combined use of mobility and the store-carry-and-forward paradigm hel...
Sabrina Gaito, Elena Pagani, Gian Paolo Rossi
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
AINA
2008
IEEE
14 years 3 months ago
Wireless Sensor Network for Localized Maritime Monitoring
In this paper, we propose a novel routing algorithm for maritime monitoring of short term events where large area monitoring relies on small buoys drifting along with local curren...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...