6045 search results - page 384 / 1209 » Computable Linearizations of Well-partial-orderings |
199
click to vote
ENTCS
2007
15 years 7 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
200
click to vote
CF
2008
ACM
15 years 9 months ago
2008
ACM
This paper contributes and evaluates a model and a methodology for implementing parallel wavefront algorithms on the Cell Broadband Engine. Wavefront algorithms are vital in sever...
258
click to vote
COMGEO
2006
ACM
15 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
242
click to vote
STOC
2000
ACM
15 years 11 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
184
click to vote
FLAIRS
1998
15 years 9 months ago
1998
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...