3946 search results - page 630 / 790 » The computational complexity of choice sets |
199
click to vote
CGF
2006
15 years 6 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
220
click to vote
TJS
2002
15 years 6 months ago
2002
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
218
click to vote
SIGGRAPH
2010
ACM
15 years 5 months ago
2010
ACM
This paper addresses the problem of remapping the disparity range of stereoscopic images and video. Such operations are highly important for a variety of issues arising from the p...
196
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
194
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...