Sciweavers

1640 search results - page 87 / 328
» Conditional Independence Trees
Sort
View
134
Voted
DLT
2003
15 years 4 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
CVPR
2001
IEEE
16 years 5 months ago
Mixtures of Trees for Object Recognition
Efficient detection of objects in images is complicated by variations of object appearance due to intra-class object differences, articulation, lighting, occlusions, and aspect va...
Sergey Ioffe, David A. Forsyth
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
16 years 24 days ago
Compact Ancestry Labeling Schemes for XML Trees
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
Fraigniaud Pierre, Korman Amos
147
Voted
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 7 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 8 months ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia