2492 search results - page 166 / 499 » On the General Signature Trees |
253
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
200
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
258
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
200
click to vote
SAC
2003
ACM
15 years 11 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
204
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...