Sciweavers

6274 search results - page 495 / 1255
» From query complexity to computational complexity
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Geometric understanding of point clouds using Laplace-Beltrami operator
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Jian Liang, Rongjie Lai, Tsz Wai Wong, Hongkai Zha...
CGF
2007
128views more  CGF 2007»
15 years 7 months ago
Stackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet availa...
Stefan Popov, Johannes Günther, Hans-Peter Se...
XSYM
2004
Springer
129views Database» more  XSYM 2004»
16 years 9 days ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
DAWAK
2006
Springer
15 years 10 months ago
Extending Visual OLAP for Handling Irregular Dimensional Hierarchies
Comprehensive data analysis has become indispensable in a variety of environments. Standard OLAP (On-Line Analytical Processing) systems, designed for satisfying the reporting need...
Svetlana Mansmann, Marc H. Scholl
JAR
2006
236views more  JAR 2006»
15 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard