1390 search results - page 271 / 278 » Computing the depth of a flat |
CVPR
2012
IEEE
12 years 6 days ago
2012
IEEE
With the recent availability of commercial light field cameras, we can foresee a future in which light field signals will be as common place as images. Hence, there is an immine...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
POPL
2008
ACM
14 years 10 months ago
2008
ACM
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...