1055 search results - page 98 / 211 » Enumerations in computable structure theory |
131
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
118
click to vote
CG
2004
Springer
15 years 4 months ago
2004
Springer
This work presents a stratification approach for modeling two-dimensional cell complexes. It introduces the concept of combinatorial stratification and uses the Handlebody theory ...
129
click to vote
CG
2002
Springer
15 years 4 months ago
2002
Springer
The paper presents a topology-based visualization method for time-dependent two-dimensional vector elds. A time interpolation enables the accurate tracking of critical points and ...
149
click to vote
ACL
2010
15 years 2 months ago
2010
The core-adjunct argument distinction is a basic one in the theory of argument structure. The task of distinguishing between the two has strong relations to various basic NLP task...
173
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...