13969 search results - page 2688 / 2794 » Child computer interaction |
124
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
116
click to vote
GRID
2006
Springer
15 years 4 months ago
2006
Springer
Grids are intended to enable cross-organizational interactions which makes Grid security a challenging and nontrivial issue. In Grids, delegation is a key facility that can be used...
137
click to vote
CG
2007
Springer
15 years 4 months ago
2007
Springer
With the availability of pen-enabled digital hardware, sketch-based 3D modeling is becoming an increasingly attractive alternative to traditional methods in many design environmen...
133
click to vote
CG
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we propose novel GPU accelerated algorithms for interactive point-based rendering (PBR) and high-quality shading of transparent point surfaces. By introducing the c...
153
Voted
CGF
2007
15 years 4 months ago
2007
We introduce a novel volume illustration technique for regularly sampled volume datasets. The fundamental difference between previous volume illustration algorithms and ours is th...