2168 search results - page 258 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
226
click to vote
SMI
2006
IEEE
16 years 13 days ago
2006
IEEE
We discuss a shape representation based on a set of disconnected (planar) polygons. The polygons are computed by creating a BSP that contains approximately linear surface patches ...
210
click to vote
CGF
2002
15 years 6 months ago
2002
Our goal is to design and build a tool for the creation of expressive character animation. Virtual puppetry, also known as performance animation, is a technique in which the user ...
174
click to vote
DPHOTO
2009
15 years 4 months ago
2009
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
187
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
199
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...