248 search results - page 42 / 50 » New Approximation Algorithms for Minimum Cycle Bases of Grap... |
226
Voted
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
234
Voted
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
121
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
126
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
170
click to vote
PAMI
2010
14 years 10 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...