Sciweavers

550 search results - page 64 / 110
» pairing 2009
Sort
View
121
Voted
DAC
2009
ACM
16 years 4 months ago
Debugging strategies for mere mortals
Recent improvements in design verification strive to automate error detection and greatly enhance engineers' ability to detect functional errors. However, the process of diag...
Valeria Bertacco
117
Voted
ICML
2009
IEEE
16 years 4 months ago
Information theoretic measures for clusterings comparison: is a correction for chance necessary?
Information theoretic based measures form a fundamental class of similarity measures for comparing clusterings, beside the class of pair-counting based and set-matching based meas...
Xuan Vinh Nguyen, Julien Epps, James Bailey
217
Voted
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 4 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
243
Voted
ECOOP
2009
Springer
16 years 4 months ago
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
Guoqing Xu, Atanas Rountev, Manu Sridharan
122
Voted
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 4 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald