ACL
2012
11 years 7 months ago
2012
This paper describes a novel approach towards the empirical approximation of discourse relations between different utterances in texts. Following the idea that every pair of event...
JOCN
2010
13 years 2 months ago
2010
■ Glass patterns are moirés created from a sparse random-dot field paired with its spatially shifted copy. Because discrimination of these patterns is not based on local featur...
IPL
2008
13 years 4 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
We propose a method to recover the global structure with local details around a point. To handle a large scale of motion i.e. 360 degree around the point, we use an optimization-b...