4934 search results - page 232 / 987 » complexity 2008 |
167
click to vote
CCCG
2008
15 years 7 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
142
click to vote
COLING
2008
15 years 7 months ago
2008
We propose a method to obtain subsentential alignments from several languages simultaneously. The method handles several languages at once, and avoids the complexity explosion due...
130
click to vote
CRIWG
2008
15 years 7 months ago
2008
This paper describes a case study addressing risk assessment in a hospital unit. The objective was to analyse the impact on collaborative work after the unit changed their installa...
158
click to vote
DICTA
2008
15 years 7 months ago
2008
Although trivial background subtraction algorithms (such as temporal averaging) can execute quite quickly, they do not give useful results in most situations. More complex algorit...
126
click to vote
EMNLP
2008
15 years 7 months ago
2008
We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...