Sciweavers

1286 search results - page 92 / 258
» A General Framework for Searching in Distributed Data Reposi...
Sort
View
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 8 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi
SOSP
2009
ACM
14 years 5 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
HICSS
1998
IEEE
104views Biometrics» more  HICSS 1998»
14 years 16 days ago
Managing Metadata for Distributed Information Servers
In this paper we present the design and implementation of a distributed index architecture to facilitate metadata discovery on large networks. Many current information discovery s...
Nigel Hinds, Chinya V. Ravishankar
CIKM
2006
Springer
14 years 9 hour ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
WWW
2008
ACM
14 years 9 months ago
A framework for fast community extraction of large-scale networks
Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modificatio...
Yutaka I. Leon-Suematsu, Kikuo Yuta