Sciweavers

455 search results - page 48 / 91
» On Trees and Noncrossing Partitions
Sort
View
PPOPP
2003
ACM
14 years 1 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
SIGGRAPH
1999
ACM
14 years 4 days ago
LDI Tree: A Hierarchical Representation for Image-Based Rendering
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
Chun-Fa Chang, Gary Bishop, Anselmo Lastra
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 11 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
BMCBI
2007
79views more  BMCBI 2007»
13 years 8 months ago
Orthology prediction at scalable resolution by phylogenetic tree analysis
Background: Orthology is one of the cornerstones of gene function prediction. Dividing the phylogenetic relations between genes into either orthologs or paralogs is however an ove...
René T. J. M. van der Heijden, Berend Snel,...
BMCBI
2006
95views more  BMCBI 2006»
13 years 8 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...