1657 search results - page 110 / 332 » Subjective Mapping |
JGT
2007
14 years 11 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
116
click to vote
SIAMCO
2011
14 years 6 months ago
2011
Abstract. A framework is introduced for the identification of controls for single-class timevarying queueing networks that are asymptotically optimal in the so-called uniform acce...
EMSOFT
2009
Springer
15 years 6 months ago
2009
Springer
NANDFS is a flash file system that exposes a memory-performance tradeoff to system integrators. The file system can be configured to use a large amount of RAM, in which case i...
CODES
2007
IEEE
15 years 6 months ago
2007
IEEE
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...
SIGGRAPH
2003
ACM
15 years 5 months ago
2003
ACM
While texture synthesis on surfaces has received much attention in computer graphics, the ideal solution that quickly produces high-quality textures with little user intervention ...