Sciweavers

664 search results - page 62 / 133
» The tree Constraint
Sort
View
ISM
2008
IEEE
83views Multimedia» more  ISM 2008»
14 years 2 months ago
Fast and Flexible Tree Rendering with Enhanced Visibility Estimation
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
Jessy Lee, C. C. Jay Kuo
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 7 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 7 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
ICMCS
2007
IEEE
101views Multimedia» more  ICMCS 2007»
14 years 2 months ago
View-Dependent Visibility Estimation for Tree Models
— A view-dependent visibility estimation technique for tree models is proposed in this work. While most previous work focused on visibility estimation of large objects in archite...
Jessy Lee, Jingliang Peng, C. C. Jay Kuo
PAKDD
2007
ACM
140views Data Mining» more  PAKDD 2007»
14 years 1 months ago
A Hybrid Multi-group Privacy-Preserving Approach for Building Decision Trees
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
Zhouxuan Teng, Wenliang Du