1055 search results - page 104 / 211 » Enumerations in computable structure theory |
139
click to vote
COMPGEOM
2001
ACM
15 years 8 months ago
2001
ACM
We present algorithms for constructing a hierarchy of increasingly coarse Morse complexes that decompose a piecewise linear 2-manifold. While Morse complexes are defined only in t...
139
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this p...
136
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
131
click to vote
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
114
click to vote
CMOT
1998
15 years 4 months ago
1998
A programming language which is optimized for modelling multi-agent interaction within articulated social structures such as organizations is described with several examples of it...