14518 search results - page 178 / 2904 » Two Problems for Sophistication |
111
click to vote
NETWORKS
2006
15 years 19 days ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
90
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The Regular Post Embedding Problem is a variant of Post’s Correspondence Problem where one compares strings with the subword relation and imposes additional regular con...
101
click to vote
CISSE
2009
Springer
15 years 4 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
103
Voted
VLDB
1991
ACM
15 years 4 months ago
1991
ACM
Domain mismatch and schema mismatch are two of the important semantic integration problems for interoperating heterogeneous databases. This paper structures the domain mismatch pr...