1105 search results - page 18 / 221 » Linear choosability of graphs |
SIGMOD
2005
ACM
15 years 3 months ago
2005
ACM
Recursion represents an important addition to the SQL language. This work focuses on the optimization of linear requeries in SQL. To provide an abstract framework for discussion, ...
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
EMNLP
2009
14 years 7 months ago
2009
Unknown lexical items present a major obstacle to the development of broadcoverage semantic role labeling systems. We address this problem with a semisupervised learning approach ...
TAGT
1994
Springer
15 years 1 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...