Sciweavers

683 search results - page 56 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
ICPP
1996
IEEE
14 years 1 days ago
Mechanisms for Mapping High-Level Parallel Performance Data
A primary problem in the performance measurement of high-level parallel programming languages is to map lowlevel events to high-level programming constructs. We discuss several as...
R. Bruce Irvin, Barton P. Miller
INFOCOM
2006
IEEE
14 years 1 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ESORICS
2011
Springer
12 years 7 months ago
Supporting Concurrency in Private Data Outsourcing
Abstract. With outsourcing emerging as a successful paradigm for delegating data and service management to third parties, the problem of guaranteeing proper privacy protection agai...
Sabrina De Capitani di Vimercati, Sara Foresti, St...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 5 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
CCCG
2008
13 years 9 months ago
Polar Diagram of Moving Objects
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using t...
Mojtaba Nouri Bygi, Mohammad Ghodsi