730 search results - page 41 / 146 » Combinatorics of Monotone Computations |
131
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
142
click to vote
RTA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
113
click to vote
COMBINATORICS
2007
15 years 4 months ago
2007
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
133
click to vote
COCOON
2001
Springer
15 years 9 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
222
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...