3608 search results - page 313 / 722 » computing 2011 |
173
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
283
click to vote
ASC
2011
15 years 1 months ago
2011
Evolutionary algorithms provide flexibility and robustness required to find satisfactory solutions in complex search spaces. This is why they are successfully applied for solvin...
203
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
139
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
197
click to vote
MST
2011
15 years 1 months ago
2011
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...