2168 search results - page 384 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
148
Voted
ISQED
2008
IEEE
15 years 10 months ago
2008
IEEE
—Power and energy consumption has emerged as the premier and most constraining aspect in modern computational systems. Dynamic Voltage Scheduling (DVS) has been provably one of t...
131
Voted
AIMSA
2008
Springer
15 years 10 months ago
2008
Springer
Abstract This paper attempts to define an emotional model for virtual agents that behave autonomously in social worlds. We adopt shallow modeling based on the decomposition of the...
143
Voted
EMMCVPR
2005
Springer
15 years 9 months ago
2005
Springer
This contribution proposes a compositionality architecture for visual object categorization, i.e., learning and recognizing multiple visual object classes in unsegmented, cluttered...
123
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
141
click to vote
PCI
2005
Springer
15 years 9 months ago
2005
Springer
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...