1213 search results - page 63 / 243 » Approximation in quantale-enriched categories |
KDD
2008
ACM
15 years 10 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
151
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
MOBIHOC
2006
ACM
15 years 9 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
COMPGEOM
2006
ACM
15 years 4 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...