288 search results - page 21 / 58 » Notes on computing minimal approximant bases |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
MIAR
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
ICFCA
2007
Springer
14 years 4 months ago
2007
Springer
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
SIGCOMM
2010
ACM
13 years 10 months ago
2010
ACM
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...