4539 search results - page 469 / 908 » Approaches to Compute Workflow Complexity |
147
click to vote
CGF
2000
15 years 6 months ago
2000
We present a technique for accelerating the rendering of high depth-complexity scenes. In a preprocessing stage, we approximate the input model with a hierarchical data structure ...
187
Voted
TCS
1998
15 years 6 months ago
1998
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
185
click to vote
VLSISP
2002
15 years 6 months ago
2002
A new and efficient class of nonlinear receivers is introduced for digital communication systems. These "iterated-decision" receivers use optimized multipass algorithms t...
172
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Passively adaptive and underactuated robotic hands have shown the potential to achieve reliable grasping in unstructured environments without expensive mechanisms or sensors. I...
175
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper presents a cascaded scheme with block-based and pixel-based codebooks for background subtraction. The codebook is mainly used to compress information to achieve high ef...