1731 search results - page 208 / 347 » Maximum likelihood analysis of algorithms and data structure... |
SIAMCOMP
1998
13 years 7 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
ICDAR
1999
IEEE
14 years 10 days ago
1999
IEEE
This paper describes our investigation into the neural gas (NG) network algorithm and the hierarchical overlapped architecture (HONG) which we have built by retaining the essence ...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Today, valuable business information is increasingly stored as unstructured data (documents, emails, etc.). For example, documents exchanged between business partners capture info...
SMI
2006
IEEE
14 years 2 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...