Sciweavers

23988 search results - page 4187 / 4798
» Social Network Computing
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
16 years 3 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
MDM
2010
Springer
153views Communications» more  MDM 2010»
16 years 2 days ago
Dessy: Search and Synchronization on the Move
—Current smartphones have a storage capacity of several gigabytes. More and more information is stored on mobile devices. To meet the challenge of information organization, we tu...
Eemil Lagerspetz, Sasu Tarkoma, Tancred Lindholm
CHI
2009
ACM
15 years 12 months ago
Contemporary domestic infrastructures and technology design
In this proposal, I describe my examination of two contemporary domestic infrastructures. Specifically, I am investigating whether we need to surface more information about these ...
Marshini Chetty
WOWMOM
2009
ACM
106views Multimedia» more  WOWMOM 2009»
15 years 12 months ago
Proactive radio resource management using optimal stopping theory
In this paper, we focus on proactive radio resource management schemes that retain the quality of the individual connections by pre-reserving the needed resources in a cellular ne...
Marios Poulakis, Stavroula Vassaki, Stathes Hadjie...
FCT
2009
Springer
15 years 12 months ago
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Abstract. In the frequency allocation problem we are given a cellular telephone network whose geographical coverage area is divided into cells where phone calls are serviced by fre...
Rafal Witkowski
« Prev « First page 4187 / 4798 Last » Next »