Sciweavers

1919 search results - page 339 / 384
» Recent Extensions to Traviando
Sort
View
MEMOCODE
2006
IEEE
15 years 3 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
MOBICOM
2006
ACM
15 years 3 months ago
Distributed channel management in uncoordinated wireless environments
Wireless 802.11 hotspots have grown in an uncoordinated fashion with highly variable deployment densities. Such uncoordinated deployments, coupled with the difficulty of implemen...
Arunesh Mishra, Vivek Shrivastava, Dheeraj Agrawal...
SIGIR
2006
ACM
15 years 3 months ago
Semantic term matching in axiomatic approaches to information retrieval
A common limitation of many retrieval models, including the recently proposed axiomatic approaches, is that retrieval scores are solely based on exact (i.e., syntactic) matching o...
Hui Fang, ChengXiang Zhai
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 3 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
CVPR
2010
IEEE
15 years 3 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan