Sciweavers

422 search results - page 52 / 85
» Shortest paths between shortest paths and independent sets
Sort
View
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
14 years 2 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy
ACTA
2010
191views more  ACTA 2010»
13 years 8 months ago
Automata-based verification of programs with tree updates
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
Peter Habermehl, Radu Iosif, Tomás Vojnar
BMCBI
2007
80views more  BMCBI 2007»
13 years 8 months ago
A network perspective on the topological importance of enzymes and their phylogenetic conservation
Background: A metabolic network is the sum of all chemical transformations or reactions in the cell, with the metabolites being interconnected by enzyme-catalyzed reactions. Many ...
Wei-chung Liu, Wen-hsien Lin, Andrew J. Davis, Fer...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 2 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
ICMCS
2007
IEEE
279views Multimedia» more  ICMCS 2007»
14 years 3 months ago
Geodesic Distances for 3D-3D and 2D-3D Face Recognition
In this paper, we propose an original framework for representing 2D and 3D face information using geodesic distances. This aims to define a representation enabling the direct com...
Stefano Berretti, Alberto Del Bimbo, Pietro Pala, ...