Sciweavers

1387 search results - page 151 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
1995
ACM
14 years 1 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
DEXA
2008
Springer
154views Database» more  DEXA 2008»
13 years 12 months ago
Approximate Range-Sum Queries over Data Cubes Using Cosine Transform
In this research, we propose to use the discrete cosine transform to approximate the cumulative distributions of data cube cells' values. The cosine transform is known to have...
Wen-Chi Hou, Cheng Luo, Zhewei Jiang, Feng Yan, Qi...
FMSB
2008
130views Formal Methods» more  FMSB 2008»
13 years 11 months ago
Approximating Continuous Systems by Timed Automata
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
Oded Maler, Grégory Batt
AAAI
1996
13 years 11 months ago
Reasoning about Continuous Processes
Overcoming the disadvantages of equidistant discretization of continuous actions, we introduce an approach that separates time into slices of varying length bordered by certain ev...
Christoph S. Herrmann, Michael Thielscher
CGA
2008
13 years 10 months ago
Legible Simplification of Textured Urban Models
Mesh simplification and discrete levels of detail (LOD) are wellstudied areas of research in computer graphics. However, until recently, most of the developed algorithms have focu...
Remco Chang, Thomas Butkiewicz, Caroline Ziemkiewi...