Sciweavers

3937 search results - page 565 / 788
» Questioning Ubiquitous Computing
Sort
View
152
Voted
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 9 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
124
Voted
ECSQARU
2009
Springer
15 years 9 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
137
Voted
SEMWEB
2009
Springer
15 years 9 months ago
Populating the Semantic Web by Macro-reading Internet Text
A key question regarding the future of the semantic web is “how will we acquire structured information to populate the semantic web on a vast scale?” One approach is to enter t...
Tom M. Mitchell, Justin Betteridge, Andrew Carlson...
106
Voted
IMC
2009
ACM
15 years 9 months ago
TCP revisited: a fresh look at TCP in the wild
Since the last in-depth studies of measured TCP traffic some 68 years ago, the Internet has experienced significant changes, including the rapid deployment of backbone links wit...
Feng Qian, Alexandre Gerber, Zhuoqing Morley Mao, ...
134
Voted
MOBICOM
2009
ACM
15 years 9 months ago
Capacity of large-scale CSMA wireless networks
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schem...
Chi-Kin Chau, Minghua Chen, Soung Chang Liew