Sciweavers

356 search results - page 62 / 72
» Further results on the subspace distance
Sort
View
ISPDC
2010
IEEE
13 years 8 months ago
Resource-Aware Compiler Prefetching for Many-Cores
—Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi- ...
George C. Caragea, Alexandros Tzannes, Fuat Keceli...
CHI
2009
ACM
14 years 4 months ago
O' game, can you feel my frustration?: improving user's gaming experience via stresscam
One of the major challenges of video game design is to have appropriate difficulty levels for users in order to maximize the entertainment value of the game. Game players may lose...
Chang Yun, Dvijesh Shastri, Ioannis Pavlidis, Zhig...
COMGEO
2011
ACM
13 years 4 months ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
12 years 7 days ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ICCAD
2006
IEEE
99views Hardware» more  ICCAD 2006»
14 years 6 months ago
Information theoretic approach to address delay and reliability in long on-chip interconnects
With shrinking feature size and growing integration density in the Deep Sub-Micron technologies, the global buses are fast becoming the “weakest-links” in VLSI design. They ha...
Rohit Singhal, Gwan S. Choi, Rabi N. Mahapatra