Sciweavers

1999 search results - page 176 / 400
» Finding Reductions Automatically
Sort
View
ANLP
2000
114views more  ANLP 2000»
15 years 3 months ago
Unsupervised Discovery of Scenario-Level Patterns for Information Extraction
Information Extraction (IE) systems are commonly based on pattern matching. Adapting an IE system to a new scenario entails the construction of a new pattern base--a timeconsuming...
Roman Yangarber, Ralph Grishman, Pasi Tapanainen
CGF
2008
101views more  CGF 2008»
15 years 1 months ago
Spectral Conformal Parameterization
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
Patrick Mullen, Yiying Tong, Pierre Alliez, Mathie...
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
15 years 1 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
107
Voted
IJCV
2000
102views more  IJCV 2000»
15 years 1 months ago
Morphable Surface Models
Abstract. We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a diffe...
Christian R. Shelton
ACL
2010
14 years 11 months ago
Collocation Extraction beyond the Independence Assumption
In this paper we start to explore two-part collocation extraction association measures that do not estimate expected probabilities on the basis of the independence assumption. We ...
Gerlof Bouma