Sciweavers

562 search results - page 32 / 113
» Ordered Sets in the Calculus of Data Structures
Sort
View
TABLEAUX
2009
Springer
15 years 4 months ago
Tableaux and Model Checking for Memory Logics
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
Carlos Areces, Diego Figueira, Daniel Gorín...
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 1 months ago
Efficient Model Creation of Large Structures based on Range Segmentation
This paper describes an efficient 3D modeling method from 3D range data-sets that is utilizing range data segmentation. Our algorithm starts with a set of unregistered 3D range sc...
Ioannis Stamos, Marius Leordeanu
COMGEO
2004
ACM
14 years 9 months ago
Kinetic collision detection between two simple polygons
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
Julien Basch, Jeff Erickson, Leonidas J. Guibas, J...
95
Voted
VISUALIZATION
2002
IEEE
15 years 2 months ago
Level-Set Segmentation From Multiple Non-Uniform Volume Datasets
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
Ken Museth, David E. Breen, Leonid Zhukov, Ross T....
DASFAA
2009
IEEE
136views Database» more  DASFAA 2009»
15 years 4 months ago
A Two-Tire Index Structure for Approximate String Matching with Block Moves
Many applications need to solve the problem of approximate string matching with block moves. It is an NP-Complete problem to compute block edit distance between two strings. Our go...
Bin Wang, Long Xie, Guoren Wang