Sciweavers

17688 search results - page 49 / 3538
» Data Set Balancing
Sort
View
119
Voted
EUROPAR
2000
Springer
15 years 6 months ago
A Combinatorial Characterization of Properties Preserved by Antitokens
Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distr...
Costas Busch, Neophytos Demetriou, Maurice Herlihy...
SIGMOD
2002
ACM
102views Database» more  SIGMOD 2002»
16 years 2 months ago
XmdvTool: visual interactive data exploration and trend discovery of high-dimensional data sets
Elke A. Rundensteiner, Matthew O. Ward, Jing Yang,...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 2 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
179
Voted
PPOPP
2010
ACM
15 years 11 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...