4850 search results - page 536 / 970 » Approximate Data Structures with Applications |
184
click to vote
ASWEC
2004
IEEE
15 years 11 months ago
2004
IEEE
"Totally Functional Programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practi...
182
click to vote
LREC
2008
15 years 8 months ago
2008
Based on simple methods such as observing word and part of speech tag co-occurrence and clustering, we generate syntactic parses of sentences in an entirely unsupervised and self-...
178
click to vote
WSCG
2004
15 years 8 months ago
2004
In this paper, the collision prediction between polyhedra under screw motions and a static scene using a new K dimensional tree data structure (Multiresolution Kdtree, MKtree) is ...
180
Voted
ACL
1997
15 years 8 months ago
1997
String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational proble...
216
Voted
CGF
2008
15 years 7 months ago
2008
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...