Sciweavers

2494 search results - page 22 / 499
» Dependable Distributed Computing Using Free Databases
Sort
View
PAKDD
2000
ACM
140views Data Mining» more  PAKDD 2000»
13 years 11 months ago
Performance Controlled Data Reduction for Knowledge Discovery in Distributed Databases
The objective of data reduction is to obtain a compact representation of a large data set to facilitate repeated use of non-redundant information with complex and slow learning alg...
Slobodan Vucetic, Zoran Obradovic
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 10 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
SPIESR
1997
97views Database» more  SPIESR 1997»
13 years 9 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
PODC
1997
ACM
13 years 11 months ago
Implementing Wait-Free Objects on Priority-Based Systems
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...
James H. Anderson, Srikanth Ramamurthy, Rohit Jain
DNIS
2010
Springer
184views Database» more  DNIS 2010»
14 years 2 months ago
A Study on Workload Imbalance Issues in Data Intensive Distributed Computing
In recent years, several frameworks have been developed for processing very large quantities of data on large clusters of commodity PCs. These frameworks have focused on fault-tole...
Sven Groot, Kazuo Goda, Masaru Kitsuregawa