Sciweavers

132 search results - page 9 / 27
» Simplices and Spectra of Graphs
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Dissimilarity-based classification for vectorial representations
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....
Elzbieta Pekalska, Robert P. W. Duin
IPTPS
2003
Springer
14 years 20 days ago
Koorde: A Simple Degree-Optimal Distributed Hash Table
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
M. Frans Kaashoek, David R. Karger
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 24 days ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
David J. Pearce, Paul H. J. Kelly
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 7 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
IJRR
2008
98views more  IJRR 2008»
13 years 7 months ago
Automatic Configuration Recognition Methods in Modular Robots
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
Michael Park, Sachin Chitta, Alex Teichman, Mark Y...