Sciweavers

32545 search results - page 37 / 6509
» Data Structures and Algorithms
Sort
View
CORR
2007
Springer
47views Education» more  CORR 2007»
14 years 9 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
APIN
2007
118views more  APIN 2007»
14 years 9 months ago
Using genetic algorithms to reorganize superpeer structure in peer to peer networks
In this thesis, we describe a genetic algorithm for optimizing the superpeer structure of semantic peer to peer networks. Peer to peer, also called P2P, networks enable us to sear...
Jaymin Kessler, Khaled Rasheed, Ismailcem Budak Ar...
ATAL
2008
Springer
14 years 11 months ago
A best-first anytime algorithm for computing optimal coalition structures
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
Chattrakul Sombattheera, Aditya Ghose
99
Voted
CVPR
2011
IEEE
14 years 5 months ago
Structure from motion for scenes with large duplicate structures
Most existing structure from motion (SFM) approaches for unordered images cannot handle multiple instances of the same structure in the scene. When image pairs containing differen...
Richard Roberts, Sudipta Sinha, Richard Szeliski, ...
100
Voted
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
14 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...