Sciweavers

2924 search results - page 373 / 585
» Lower Bounds in Distributed Computing
Sort
View
ICPADS
2008
IEEE
15 years 11 months ago
Towards Benchmarking of Structured Peer-to-Peer Overlays for Network Virtual Environments
Network virtual environments (NVE) are an evolving trend combining millions of users in an interactive community. A distributed NVE platform promises to lower the administration c...
Aleksandra Kovacevic, Kalman Graffi, Sebastian Kau...
142
Voted
COREGRID
2007
Springer
15 years 11 months ago
Atomic Commitment in Transactional DHTs
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. Therefore we present a framework for DHTs to provide strong d...
Monika Moser, Seif Haridi
IPPS
2009
IEEE
15 years 11 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram
DCOSS
2008
Springer
15 years 6 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
COLT
2001
Springer
15 years 9 months ago
On Using Extended Statistical Queries to Avoid Membership Queries
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
Nader H. Bshouty, Vitaly Feldman