281 search results - page 44 / 57 » The Complexity of Planar Counting Problems |
148
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Contextual advertising (also called content match) refers to the placement of small textual ads within the content of a generic web page. It has become a significant source of rev...
140
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
137
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
131
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Locked tree linkages have been known to exist in the plane since 1998, but it is still open whether they have a polynomial-time characterization. This paper examines the properties...
138
click to vote
SMI
2008
IEEE
15 years 10 months ago
2008
IEEE
Following the definition of developable surface in differential geometry, the flattenable mesh surface, a special type of piecewiselinear surface, inherits the good property of ...