4536 search results - page 540 / 908 » Contention-Sensitive Data Structures and Algorithms |
211
click to vote
SBBD
2007
15 years 8 months ago
2007
Abstract. A lot of recent applications dealing with complex data require sophisticated data structures (trees or graphs) for their specification. Recently, several techniques for ...
229
click to vote
ACL
2006
15 years 8 months ago
2006
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
191
click to vote
MSV
2004
15 years 8 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
204
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we introduce a system, written in Haskell, for filtering information from XML data. Essentially, the system implements a simple declarative language which allows on...
161
click to vote
VIS
2007
IEEE
16 years 8 months ago
2007
IEEE
Volumetric data commonly has high depth complexity which makes it difficult to judge spatial relationships accurately. There are many different ways to enhance depth perception, su...