1322 search results - page 180 / 265 » Parameterized counting problems |
133
Voted
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Algorithmic skeletons correspond to a high-level programming model that takes advantage of nestable programming patterns to hide the complexity of parallel/distributed ap...
113
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
133
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
127
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
131
Voted
CIMAGING
2010
15 years 5 months ago
2010
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...