Sciweavers

1284 search results - page 174 / 257
» Data Structures for Mergeable Trees
Sort
View
COLING
2008
14 years 11 months ago
Grammar Comparison Study for Translational Equivalence Modeling and Statistical Machine Translation
This paper presents a general platform, namely synchronous tree sequence substitution grammar (STSSG), for the grammar comparison study in Translational Equivalence Modeling (TEM)...
Min Zhang, Hongfei Jiang, Haizhou Li, AiTi Aw, She...
ENGL
2007
91views more  ENGL 2007»
14 years 10 months ago
RRT-based strategies for sensor-based exploration
—Real mobile robots should be able to build an abstract representation of the physical environment, in order to navigate and to work in such environment. We present a method for ...
Abraham Sánchez López, Judith Le&oac...
ICDE
2002
IEEE
102views Database» more  ICDE 2002»
15 years 11 months ago
Cost Models for Overlapping and Multi-Version B-Trees
Overlapping and multi-version techniques are two popular frameworks that transform an ephemeral index into a multiple logical-tree structure in order to support versioning databas...
Yufei Tao, Dimitris Papadias, Jun Zhang
CIKM
2005
Springer
15 years 5 hour ago
Handling frequent updates of moving objects
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...
Bin Lin, Jianwen Su
STACS
2001
Springer
15 years 2 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid