1101 search results - page 185 / 221 » An Algorithm for the Graph Crossing Number Problem |
133
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
131
click to vote
CIKM
2011
Springer
14 years 1 months ago
2011
Springer
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
102
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
SIAMCOMP
1998
15 years 1 months ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
151
click to vote
NIPS
2004
15 years 3 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...