1810 search results - page 210 / 362 » Similarity estimation techniques from rounding algorithms |
121
Voted
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
133
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
132
Voted
CCCG
2009
15 years 4 months ago
2009
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...
153
Voted
TMI
2010
14 years 10 months ago
2010
Within-subject analysis in fMRI essentially addresses two problems, the detection of brain regions eliciting evoked activity and the estimation of the underlying dynamics. In [1, 2...
111
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Near-duplicate web documents are abundant. Two such documents differ from each other in a very small portion that displays advertisements, for example. Such differences are irrele...