Sciweavers

8512 search results - page 397 / 1703
» Computing Theory With Relevance
Sort
View
IJISEC
2007
119views more  IJISEC 2007»
15 years 6 months ago
An incentive compatible reputation mechanism for ubiquitous computing environments
The vision of ubiquitous computing is becoming a reality thanks to the advent of portable devices and the advances in wireless networking technologies. It aims to facilitate user ...
Jinshan Liu, Valérie Issarny
POPL
2008
ACM
16 years 7 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 7 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
ICC
2009
IEEE
120views Communications» more  ICC 2009»
16 years 1 months ago
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
Soung Chang Liew, Caihong Kai, Jason Leung, Bill W...
ITNG
2007
IEEE
16 years 1 months ago
Computational Power of the Quantum Turing Automata
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...