Sciweavers

1517 search results - page 56 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
SIGMETRICS
2006
ACM
102views Hardware» more  SIGMETRICS 2006»
15 years 10 months ago
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
Markus Fidler, Jens B. Schmitt
152
Voted
CIDR
2009
157views Algorithms» more  CIDR 2009»
15 years 5 months ago
SCADS: Scale-Independent Storage for Social Computing Applications
Collaborative web applications such as Facebook, Flickr and Yelp present new challenges for storing and querying large amounts of data. As users and developers are focused more on...
Michael Armbrust, Armando Fox, David A. Patterson,...
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 10 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
154
Voted
IFIP12
2008
15 years 6 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
150
Voted
CLUSTER
2002
IEEE
15 years 9 months ago
Algorithmic Mechanism Design for Load Balancing in Distributed Systems
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
Daniel Grosu, Anthony T. Chronopoulos