Sciweavers

755 search results - page 91 / 151
» Graph Transformation for Topology Modelling
Sort
View
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
14 years 2 months ago
Parallel FFT computation with a CDMA-based network-on-chip
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
Daewook Kim, Manho Kim, Gerald E. Sobelman
ICSM
2003
IEEE
14 years 2 months ago
Software Architecture Recovery based on Pattern Matching
This paper is a summary of the author’s thesis that presents a model and an environment for recovering the high level design of legacy software systems based on user defined ar...
Kamran Sartipi
COLT
2004
Springer
14 years 2 months ago
Graphical Economics
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
Sham Kakade, Michael J. Kearns, Luis E. Ortiz
PUK
2003
13 years 10 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
13 years 8 days ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...