Sciweavers

828 search results - page 32 / 166
» Simplicial Powers of Graphs
Sort
View
GBRPR
2007
Springer
14 years 2 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
TOCS
1998
83views more  TOCS 1998»
13 years 8 months ago
Using Value Prediction to Increase the Power of Speculative Execution Hardware
This paper presents an experimental and analytical study of value prediction and its impact on speculative execution in superscalar microprocessors. Value prediction is a new para...
Freddy Gabbay, Avi Mendelson
CEC
2007
IEEE
14 years 3 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
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
14 years 2 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
CCR
2002
130views more  CCR 2002»
13 years 8 months ago
Network topologies, power laws, and hierarchy
It has long been thought that the Internet, and its constituent networks, are hierarchical in nature. Consequently, the network topology generators most widely used by the Interne...
Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Ja...