Sciweavers

6192 search results - page 97 / 1239
» Structure benefits all
Sort
View
COLING
1992
13 years 10 months ago
Dynamic Programming Method for Analyzing Conjunctive Structures in Japanese
Parsing a long sentence is very difficult, since long sentences often have conjunctions which result in ambiguities. If the conjunctive structures existing in a long sentence can ...
Sadao Kurohashi, Makoto Nagao
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 8 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
13 years 8 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
PPL
2008
99views more  PPL 2008»
13 years 8 months ago
A Modular Implementation of Data Structures in Bulk-Synchronous Parallel ML
A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterpart...
Frédéric Gava
SIAMCOMP
1998
141views more  SIAMCOMP 1998»
13 years 8 months ago
Randomized Data Structures for the Dynamic Closest-Pair Problem
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
Mordecai J. Golin, Rajeev Raman, Christian Schwarz...