Sciweavers

2466 search results - page 293 / 494
» Algorithms for distributed functional monitoring
Sort
View
117
Voted
PODC
2010
ACM
15 years 6 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
110
Voted
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 2 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
136
Voted
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 9 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
123
Voted
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 4 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
107
Voted
AI
2009
Springer
15 years 9 months ago
Cost-Based Sampling of Individual Instances
In many practical domains, misclassification costs can differ greatly and may be represented by class ratios, however, most learning algorithms struggle with skewed class distrib...
William Klement, Peter A. Flach, Nathalie Japkowic...