564 search results - page 99 / 113 » Approximation algorithms for restricted Bayesian network str... |
137
click to vote
SIAMCOMP
2011
14 years 7 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
111
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
123
Voted
BMCBI
2010
15 years 18 days ago
2010
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
124
Voted
CIKM
2010
Springer
14 years 11 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...