5100 search results - page 876 / 1020 » The Linear Complexity of a Graph |
152
Voted
COMPGEOM
1993
ACM
15 years 9 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
138
click to vote
ICLP
1993
Springer
15 years 9 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
136
click to vote
ICS
1993
Tsinghua U.
15 years 9 months ago
1993
Tsinghua U.
—Data dependence analysis techniques are the main component of today’s strategies for automatic detection of parallelism. Parallelism detection strategies are being incorporate...
180
Voted
JELIA
1994
Springer
15 years 9 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
131
click to vote
SIGGRAPH
1992
ACM
15 years 9 months ago
1992
ACM
We present a new approachto interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleabl...