256 search results - page 16 / 52 » Short trees in polygons |
COMGEO
2000
ACM
13 years 8 months ago
2000
ACM
We present a fast and accurate collision detection algorithm for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, cons...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
We discuss a lossless data compression system that uses fixed Tree Machines to encode data. The idea is to create a sequence of Tree Machines and a robust escape method aimed at p...
ACL
2009
13 years 6 months ago
2009
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
ACL
2006
13 years 10 months ago
2006
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...