Sciweavers

2035 search results - page 178 / 407
» Working memory
Sort
View
ICIP
2001
IEEE
16 years 5 months ago
Optical flow estimation using high frame rate sequences
Gradient-based optical flow estimation methods such as LucasKanade method work well for scenes with small displacements but fail when objects move with large displacements. Hierar...
SukHwan Lim, Abbas El Gamal
VLSID
2009
IEEE
96views VLSI» more  VLSID 2009»
16 years 4 months ago
Efficient Placement of Compressed Code for Parallel Decompression
Code compression is important in embedded systems design since it reduces the code size (memory requirement) and thereby improves overall area, power and performance. Existing res...
Xiaoke Qin, Prabhat Mishra
CHI
2008
ACM
16 years 4 months ago
Idea management in creative lives
This research explores how ideas occur in creative work and the strategies and tools used to represent and develop them. We describe the analysis of an open questionnaire survey o...
Tim Coughlan, Peter Johnson
HPCA
2001
IEEE
16 years 4 months ago
Reevaluating Online Superpage Promotion with Hardware Support
fipical translation lookaside buffers (TLBs)can map a far smaller region of memory than application footprints demand, and the cost of handling TLB misses therefore limits the per...
Zhen Fang, Lixin Zhang, John B. Carter, Wilson C. ...
132
Voted
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
16 years 3 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman