614 search results - page 12 / 123 » DE in Slovenia: Where are We |
ECAI
1990
Springer
13 years 11 months ago
1990
Springer
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
SGAI
2007
Springer
14 years 1 months ago
2007
Springer
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
GEOINFO
2007
13 years 9 months ago
2007
This paper describes a model for spatiotemporal objects whose location is fixed, but its boundaries and properties change. We refer to these as evolving objects. We consider cases ...
ICML
2006
IEEE
14 years 8 months ago
2006
IEEE
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...