1322 search results - page 182 / 265 » Parameterized counting problems |
140
click to vote
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
130
Voted
SASO
2008
IEEE
15 years 10 months ago
2008
IEEE
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
126
Voted
IWCIA
2004
Springer
15 years 9 months ago
2004
Springer
We consider selected geometric properties of 2D or 3D sets, given in form of binary digital pictures, and discuss their estimation. The properties examined are perimeter and area i...
117
click to vote
FPL
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...
130
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...