Sciweavers

3107 search results - page 601 / 622
» Parallel Communication
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CVPR
2010
IEEE
1208views Computer Vision» more  CVPR 2010»
14 years 6 months ago
Visual Tracking Decomposition
We propose a novel tracking algorithm that can work robustly in a challenging scenario such that several kinds of appearance and motion changes of an object occur at the same time....
Junseok Kwon (Seoul National University), Kyoung M...
SBCCI
2005
ACM
276views VLSI» more  SBCCI 2005»
14 years 3 months ago
Virtual channels in networks on chip: implementation and evaluation on hermes NoC
Networks on chip (NoCs) draw on concepts inherited from distributed systems and computer networks subject areas to interconnect IP cores in a structured and scalable way. Congesti...
Aline Mello, Leonel Tedesco, Ney Calazans, Fernand...
MICRO
2008
IEEE
137views Hardware» more  MICRO 2008»
14 years 4 months ago
Tradeoffs in designing accelerator architectures for visual computing
Visualization, interaction, and simulation (VIS) constitute a class of applications that is growing in importance. This class includes applications such as graphics rendering, vid...
Aqeel Mahesri, Daniel R. Johnson, Neal C. Crago, S...
TIT
2002
72views more  TIT 2002»
13 years 10 months ago
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
The entanglement-assisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses...
Charles H. Bennett, Peter W. Shor, John A. Smolin,...