Sciweavers

4781 search results - page 146 / 957
» Complexity at large
Sort
View
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 10 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
ICS
2009
Tsinghua U.
14 years 5 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 4 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
DOCENG
2003
ACM
14 years 3 months ago
Using SVG as the rendering model for structured and graphically complex web material
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
Julius C. Mong, David F. Brailsford
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 3 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain