Sciweavers

2110 search results - page 379 / 422
» What is the complexity of a distributed computing system
Sort
View
ACL
2010
15 years 2 months ago
Towards Robust Multi-Tool Tagging. An OWL/DL-Based Approach
This paper describes a series of experiments to test the hypothesis that the parallel application of multiple NLP tools and the integration of their results improves the correctne...
Christian Chiarcos
SIGECOM
2003
ACM
110views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Virtual worlds: fast and strategyproof auctions for dynamic resource allocation
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
Chaki Ng, David C. Parkes, Margo I. Seltzer
127
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Fast estimation of the state of the power grid using synchronized phasor measurements
—Both the communication limitation and the measurement properties based algorithm become the bottleneck of enhancing the traditional power system state estimation speed. The avai...
Tao Yang, Anjan Bose
DSN
2002
IEEE
15 years 9 months ago
Model Checking Performability Properties
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
Boudewijn R. Haverkort, Lucia Cloth, Holger Herman...
MM
2010
ACM
125views Multimedia» more  MM 2010»
15 years 4 months ago
Tenor: making coding practical from servers to smartphones
It has been theoretically shown that performing coding in networked systems, including Reed-Solomon codes, fountain codes, and random network coding, has a clear advantage with re...
Hassan Shojania, Baochun Li