Sciweavers

336 search results - page 12 / 68
» Analytic Cut Trees
Sort
View
PG
2007
IEEE
14 years 1 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
CLOUD
2010
ACM
14 years 22 days ago
Stateful bulk processing for incremental analytics
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
Dionysios Logothetis, Christopher Olston, Benjamin...
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 9 months ago
Financial Time Series Segmentation based on Specialized Binary Tree Representation
Segmentation is one of the fundamental components in time series data mining. One of the uses of the time series segmentation is trend analysis - to segment the time series into pr...
Tak-Chung Fu, Fu-Lai Chung, Chak-man Ng
LICS
2007
IEEE
14 years 1 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen
LFCS
2009
Springer
14 years 2 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky