Sciweavers

877 search results - page 70 / 176
» Structural Cut Elimination
Sort
View
ACL
1989
13 years 9 months ago
Automatic Acquisition of the Lexical Semantics of Verbs from Sentence Frames
This paper presents a computational model ofverb acquisitionwhich uses what we willcallthe principle of structured overeommitment to eliminate the need for negative evidence. The ...
Mort Webster, Mitchell P. Marcus
CVPR
2010
IEEE
13 years 8 months ago
Delineating trees in noisy 2D images and 3D image-stacks
We present a novel approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local evidence, ou...
Germán González, Engin Türetken...
MM
2004
ACM
99views Multimedia» more  MM 2004»
14 years 1 months ago
Locality preserving clustering for image database
It is important and challenging to make the growing image repositories easy to search and browse. Image clustering is a technique that helps in several ways, including image data ...
Xin Zheng, Deng Cai, Xiaofei He, Wei-Ying Ma, Xuey...
PASTE
2010
ACM
13 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
ISCA
2011
IEEE
271views Hardware» more  ISCA 2011»
12 years 11 months ago
CRIB: consolidated rename, issue, and bypass
Conventional high-performance processors utilize register renaming and complex broadcast-based scheduling logic to steer instructions into a small number of heavily-pipelined exec...
Erika Gunadi, Mikko H. Lipasti