Sciweavers

1431 search results - page 82 / 287
» The complexity of random ordered structures
Sort
View
87
Voted
COLING
2000
15 years 1 months ago
Structural disambiguation of morpho-syntactic categorial parsing for Korean
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
Jeongwon Cha, Gary Geunbae Lee
96
Voted
COLING
2000
15 years 1 months ago
XMLTrans: a Java-based XML Transformation Language for Structured Data
The recently completed MLIS DicoPro project addressed the need for a uniform, platformindependent interface for accessing multiple dictionaries and other lexical resources via the...
Derek Walker, Dominique Petitpierre, Susan Armstro...
99
Voted
ICIP
2010
IEEE
14 years 10 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
85
Voted
EOR
2006
72views more  EOR 2006»
15 years 18 days ago
Experimental tour-based travel demand models
CT In this paper some experimental sequential models for the simulation of trip-chains are presented; the models have been calibrated on the base of a survey made in a medium-sized...
Demetrio C. Festa, Daniela Condino, Gabriella Mazz...
98
Voted
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 5 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld