1274 search results - page 100 / 255 » Graph lambda theories |
STACS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
SIGMOD
1999
ACM
14 years 1 months ago
1999
ACM
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...
LREC
2010
13 years 10 months ago
2010
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...