13603 search results - page 2687 / 2721 » On the Complexity of Computing Treelength |
SIGMOD
2010
ACM
13 years 9 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
SMA
2010
ACM
13 years 9 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
WWW
2010
ACM
13 years 9 months ago
2010
ACM
Popularity of content in social media is unequally distributed, with some items receiving a disproportionate share of attention from users. Predicting which newly-submitted items ...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
A key step in distributed video coding is the generation of the side information (SI) i.e. the estimation of the Wyner-Ziv frame (WZF). This step is also frequently called image i...
APPML
2007
13 years 9 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...