Sciweavers

15033 search results - page 360 / 3007
» Complexity Theory and Algorithms
Sort
View
COCOON
2008
Springer
15 years 9 months ago
The Computational Complexity of Link Building
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
Martin Olsen
CPHYSICS
2011
267views Education» more  CPHYSICS 2011»
14 years 10 months ago
Fast alignment of a complex tracking detector using advanced track models
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...
Volker Blobel, Claus Kleinwort, Frank Meier
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic algorithms for positioning and utilizing sensors in synthetically generated landscapes
Positioning multiple sensors for acquisition of a a given environment is one of the fundamental research areas in various fields, such as military scouting, computer vision and ro...
Haluk Topcuoglu, Murat Ermis
190
Voted
FTTCS
2006
106views more  FTTCS 2006»
15 years 7 months ago
Algorithmic Results in List Decoding
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redunda...
Venkatesan Guruswami
CIMCA
2005
IEEE
16 years 22 days ago
Potentials and Limits of Graph-Algorithms for Discovering Ontology Patterns
The aim of the research presented in this paper is to contribute to reduction of development time for ontologies by discovering reusable parts and patterns. The approach is to use...
Christer Thörn, Orjan Eriksson, Eva Blomqvist...