Sciweavers

Share
5 search results - page 1 / 1
» An Approximate Maximum Common Subgraph Algorithm for Large D...
Sort
View
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
11 years 1 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
10 years 4 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
12 years 1 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
SPAA
2004
ACM
11 years 6 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICML
2008
IEEE
12 years 2 months ago
Modified MMI/MPE: a direct evaluation of the margin in speech recognition
In this paper we show how common speech recognition training criteria such as the Minimum Phone Error criterion or the Maximum Mutual Information criterion can be extended to inco...
Georg Heigold, Hermann Ney, Ralf Schlüter, Th...
books