Sciweavers

1728 search results - page 300 / 346
» Social Computing: Fundamentals and applications
Sort
View
MOBIHOC
2010
ACM
13 years 5 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...
SIGGRAPH
1999
ACM
13 years 12 months ago
Creating a Live Broadcast from a Virtual Environment
“Inhabited Television” combines multiuser virtual environments with television, so that online audience-members can participate in TV shows staged in a virtual world. It is pr...
Chris Greenhalgh, John Bowers, Graham Walker, John...
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 7 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CAE
2010
13 years 2 months ago
Learning about Shadows from Artists
Renaissance artists discovered methods for imaging realistic depth on a two dimensional surface by re-inventing linear perspective. In solving the problem of depth depiction, they...
Elodie Fourquet
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...