Sciweavers

767 search results - page 69 / 154
» On Clustering Using Random Walks
Sort
View
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
14 years 1 months ago
Manipulation-Resistant Reputations Using Hitting Time
Popular reputation systems for linked networks can be manipulated by spammers who strategically place links. The reputation of node v is interpreted as the world’s opinion of v...
John E. Hopcroft, Daniel Sheldon
INFFUS
2006
142views more  INFFUS 2006»
13 years 7 months ago
Moderate diversity for better cluster ensembles
Adjusted Rand index is used to measure diversity in cluster ensembles and a diversity measure is subsequently proposed. Although the measure was found to be related to the quality...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva, ...
SIGGRAPH
2010
ACM
14 years 6 days ago
Sampling-based contact-rich motion control
Human motions are the product of internal and external forces, but these forces are very difficult to measure in a general setting. Given a motion capture trajectory, we propose ...
Libin Liu, KangKang Yin, Michiel van de Panne, Tia...
EUROPAR
2009
Springer
13 years 5 months ago
A Least-Resistance Path in Reasoning about Unstructured Overlay Networks
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
Giorgos Georgiadis, Marina Papatriantafilou
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 6 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman