Sciweavers

1648 search results - page 78 / 330
» On the generation of bicliques of a graph
Sort
View
NIPS
2003
15 years 1 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
ER
2004
Springer
79views Database» more  ER 2004»
15 years 5 months ago
Multi-phase Process Mining: Building Instance Graphs
Abstract. Deploying process-driven information systems is a time-consuming and error-prone task. Process mining attempts to improve this by automatically generating a process model...
Boudewijn F. van Dongen, Wil M. P. van der Aalst
WG
1993
Springer
15 years 3 months ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
DSD
2006
IEEE
110views Hardware» more  DSD 2006»
15 years 5 months ago
A Graph Based Algorithm for Data Path Optimization in Custom Processors
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, ...
DAM
2008
145views more  DAM 2008»
14 years 11 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug