Sciweavers

4886 search results - page 83 / 978
» Approximate Data Exchange
Sort
View
DMIN
2006
174views Data Mining» more  DMIN 2006»
15 years 6 months ago
Association Rule Mining from XML Data
- With the growing usage of XML in the World Wide Web and elsewhere as a standard for the exchange of data and to represent semistructured data, there is an imminent need for tools...
Qin Ding, Gnanasekaran Sundarraj
145
Voted
ATAL
2010
Springer
15 years 5 months ago
Divide-and-coordinate: DCOPs by agreement
In this paper we investigate an approach to provide approximate, anytime algorithms for DCOPs that can provide quality guarantees. At this aim, we propose the divide-and-coordinat...
Meritxell Vinyals, Marc Pujol, Juan A. Rodrí...
152
Voted
CORR
2011
Springer
204views Education» more  CORR 2011»
14 years 11 months ago
Accelerated Dual Descent for Network Optimization
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...
Michael Zargham, A. Ribeiro, Ali Jadbabaie, Asuman...
JPDC
2006
123views more  JPDC 2006»
15 years 4 months ago
Data redistribution and remote method invocation for coupled components
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity o...
Felipe Bertrand, Randall Bramley, David E. Bernhol...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon