Sciweavers

784 search results - page 73 / 157
» Relaxing the Value Restriction
Sort
View
ICPR
2008
IEEE
16 years 17 days ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
16 years 13 days ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
197
Voted
CEC
2011
IEEE
14 years 6 months ago
Stochastic Natural Gradient Descent by estimation of empirical covariances
—Stochastic relaxation aims at finding the minimum of a fitness function by identifying a proper sequence of distributions, in a given model, that minimize the expected value o...
Luigi Malagò, Matteo Matteucci, Giovanni Pi...
ISORC
2008
IEEE
16 years 16 days ago
A Flexible Trust Model for Distributed Service Infrastructures
Recent years have witnessed the emergence and rapid growth of distributed service infrastructures such as mobile ad hoc networks, P2P, PlanetLab and Grids. In such distributed inf...
Zhaoyu Liu, Stephen S. Yau, Dichao Peng, Yin Yin
161
Voted
ECML
2007
Springer
16 years 9 days ago
A Simple Lexicographic Ranker and Probability Estimator
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
Peter A. Flach, Edson Takashi Matsubara