Sciweavers

110 search results - page 8 / 22
» A Novel Performance-Driven Topology Design Algorithm
Sort
View
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
14 years 11 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
EMMCVPR
2003
Springer
15 years 2 months ago
Surface Recovery from 3D Point Data Using a Combined Parametric and Geometric Flow Approach
This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper...
Peter Savadjiev, Frank P. Ferrie, Kaleem Siddiqi
RSA
2010
98views more  RSA 2010»
14 years 8 months ago
Network delay inference from additive metrics
We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multi...
Shankar Bhamidi, Ram Rajagopal, Sébastien R...
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
15 years 1 months ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
CEC
2007
IEEE
15 years 4 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers