Sciweavers

62 search results - page 8 / 13
» Exact Covers via Determinants
Sort
View
IPPS
2000
IEEE
13 years 11 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
TCS
2008
13 years 7 months ago
Self-deployment of mobile sensors on a ring
Mobile sensors can self-deploy in a purely decentralized and distributed fashion, so to reach in finite time a state of static equilibrium in which they cover uniformly the enviro...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
GRID
2006
Springer
13 years 7 months ago
Flexible and Secure Logging of Grid Data Access
-- In Grid collaborations, scientists use middleware to execute computational experiments, visualize results, and securely share data on resources ranging from desktop machines to ...
Weide Zhang, David Del Vecchio, Glenn S. Wasson, M...
MFCS
2009
Springer
14 years 2 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
DOLAP
2004
ACM
14 years 29 days ago
Cardinality-based inference control in OLAP systems: an information theoretic approach
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensi...
Nan Zhang 0004, Wei Zhao, Jianer Chen