Sciweavers

78 search results - page 13 / 16
» A Uniform Approach to Underspecification and Parallelism
Sort
View
DMIN
2006
134views Data Mining» more  DMIN 2006»
15 years 9 days ago
Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination
The stochastic discrimination (SD) theory considers learning as building models of uniform coverage over data distributions. Despite successful trials of the derived SD method in s...
Iryna Skrypnyk, Tin Kam Ho
105
Voted
PODC
2004
ACM
15 years 4 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
90
Voted
IPM
2007
137views more  IPM 2007»
14 years 10 months ago
Analyzing imbalance among homogeneous index servers in a web search system
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
Claudine Santos Badue, Ricardo A. Baeza-Yates, Ber...
80
Voted
CCGRID
2006
IEEE
15 years 5 months ago
ReCon: A Fast and Reliable Replica Retrieval Service for the Data Grid
The Data Grid provides a scalable infrastructure for storage resources and data distribution management. It also supports a variety of scientific applications that require access...
XiaoLi Zhou, Eunsung Kim, Jai Wug Kim, Heon Young ...
101
Voted
MFCS
2004
Springer
15 years 4 months ago
Optimal Preemptive Scheduling for General Target Functions
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
Leah Epstein, Tamir Tassa