3020 search results - page 331 / 604 » Optimal partition trees |
159
click to vote
VVS
1996
IEEE
15 years 10 months ago
1996
IEEE
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
173
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
We address the problem of nding useful regions for two-dimensional association rules and decision trees. In a previous paper we presented ecient algorithms for computing optimiz...
179
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
169
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
177
click to vote
TCAD
2010
15 years 1 months ago
2010
Clock mesh networks are well known for their variation tolerance. But their usage is limited to high-end designs due to the significantly high resource requirements compared to clo...