2430 search results - page 396 / 486 » Computing Tutte Polynomials |
155
Voted
FOIKS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
114
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
122
click to vote
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
120
click to vote
IWPEC
2004
Springer
15 years 8 months ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
135
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...