Sciweavers

FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 11 months ago
Ranking of Closeness Centrality for Large-Scale Social Networks
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
Kazuya Okamoto, Wei Chen, Xiang-Yang Li
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 11 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
13 years 11 months ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
Guoqiang Bai 0002, Henning Fernau
EVOW
2008
Springer
13 years 11 months ago
A Study of Some Implications of the No Free Lunch Theorem
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
Andrea Valsecchi, Leonardo Vanneschi
ETRA
2008
ACM
149views Biometrics» more  ETRA 2008»
13 years 11 months ago
The incomplete fixation measure
In this paper we evaluate several of the most popular algorithms for segmenting fixations from saccades by testing these algorithms on the scanning patterns of toddlers. We show t...
Frederick Shic, Brian Scassellati, Katarzyna Chawa...
ESA
2008
Springer
80views Algorithms» more  ESA 2008»
13 years 11 months ago
Randomized Competitive Analysis for Two-Server Problems
We prove that there exits a randomized online algorithm for the 2-server 3-point problem whose
Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
13 years 11 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
ESA
2008
Springer
129views Algorithms» more  ESA 2008»
13 years 11 months ago
More Robust Hashing: Cuckoo Hashing with a Stash
Cuckoo hashing holds great potential as a high-performance hashing scheme for real applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that there...
Adam Kirsch, Michael Mitzenmacher, Udi Wieder
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
13 years 11 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre