15416 search results - page 338 / 3084 » Embeddings of Computable Structures |
174
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we articulate a new modeling paradigm for both local and global editing on complicated point set surfaces of arbitrary topology. In essence, the proposed technique l...
176
click to vote
GD
1995
Springer
15 years 10 months ago
1995
Springer
It is a di cult problem to display large, complex graphs in a manner which furthers comprehension. A useful approach is to expand selected sections foci of the graph revealing de...
172
click to vote
EICS
2010
ACM
15 years 9 months ago
2010
ACM
Modern User Interfaces (UI) must deal with the increasing complexity of applications in terms of functionality as well as new properties as plasticity. The plasticity of a UI deno...
175
click to vote
JMM2
2007
15 years 6 months ago
2007
—Optical flow algorithms are difficult to apply to robotic vision applications in practice because of their extremely high computational and frame rate requirements. In most case...
168
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...