Sciweavers

5889 search results - page 417 / 1178
» Graph Layout Problems
Sort
View
133
Voted
TCAD
2008
75views more  TCAD 2008»
15 years 6 months ago
An Efficient Graph-Based Algorithm for ESD Current Path Analysis
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
Chih-Hung Liu, Hung-Yi Liu, Chung-Wei Lin, Szu-Jui...
TCS
2008
15 years 6 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
ALGORITHMICA
2011
15 years 1 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
ICPR
2008
IEEE
16 years 8 months ago
Similarity-based matching for face authentication
We propose in this paper a face authentication method based on a similarity measure. The SIFT descriptor is used to define some interest keypoints characterized by an invariant pa...
Christophe Rosenberger, Luc Brun
179
Voted
DAWAK
2007
Springer
16 years 1 months ago
What-If Analysis for Data Warehouse Evolution
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...
George Papastefanatos, Panos Vassiliadis, Alkis Si...