1640 search results - page 107 / 328 » Conditional Independence Trees |
127
click to vote
JCSS
2006
15 years 3 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
130
Voted
JOT
2006
15 years 3 months ago
2006
Many data base applications require the storage and manipulation of different versions of data objects. To satisfy the diverse needs of these applications, current database system...
180
click to vote
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
123
click to vote
DIM
2008
ACM
15 years 5 months ago
2008
ACM
Public-key based certificates provide a standard way to prove one's identity, as attested by some certificate authority (CA). However, plain certificates provide a binary ide...
130
Voted
ANLP
1992
15 years 4 months ago
1992
The availability of large files of manuallyreviewed parse trees from the University of Pennsylvania "tree bank", along with a program for comparing system-generated pars...