3020 search results - page 142 / 604 » Optimal partition trees |
190
click to vote
ADC
2006
Springer
16 years 14 days ago
2006
Springer
Query answering over OWLs and RDFs on the Semantic Web is, in general, a deductive process. To this end, OWL, a family of web ontology languages based on description logic, has be...
184
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
179
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a strategy for efficiently rendering time-varying volume data on a distributed-memory parallel computer. Visualizing time-varying volume data take both large s...
169
click to vote
NIPS
2007
15 years 8 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
172
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...