Sciweavers

625 search results - page 113 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
IEEEARES
2008
IEEE
15 years 3 months ago
Rapid Detection of Constant-Packet-Rate Flows
—The demand for effective VoIP and online gaming traffic management methods continues to increase for purposes such as QoS provisioning, usage accounting, and blocking VoIP call...
Kuan-Ta Chen, Jing-Kai Lou
JUCS
2008
120views more  JUCS 2008»
14 years 9 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...
DCOSS
2008
Springer
14 years 11 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...

Publication
116views
14 years 9 months ago
Poking Facebook: Characterization of OSN Applications
Facebook is one of the most popular Internet sites today. A key fea- ture that arguably contributed to Facebook's unprecedented success is its application platform, which enab...
Minas Gjoka, Michael Sirivianos, Athina Markopoulo...
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 9 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan