Sciweavers

2421 search results - page 397 / 485
» Message from the Co-Chairs
Sort
View
MOBIHOC
2009
ACM
14 years 9 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
CHI
2006
ACM
14 years 9 months ago
Error correction of voicemail transcripts in SCANMail
Despite its widespread use, voicemail presents numerous usability challenges: People must listen to messages in their entirety, they cannot search by keywords, and audio files do ...
Moira Burke, Brian Amento, Philip L. Isenhour
STOC
2005
ACM
112views Algorithms» more  STOC 2005»
14 years 9 months ago
The complexity of agreement
A celebrated 1976 theorem of Aumann asserts that honest, rational Bayesian agents with common priors will never "agree to disagree": if their opinions about any topic ar...
Scott Aaronson
SIGMOD
2004
ACM
165views Database» more  SIGMOD 2004»
14 years 9 months ago
Industrial-Strength Schema Matching
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
PERCOM
2007
ACM
14 years 8 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...