Sciweavers

1104 search results - page 141 / 221
» Experimental evaluation of optimal CSMA
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
MM
2006
ACM
158views Multimedia» more  MM 2006»
14 years 4 months ago
Extreme video retrieval: joint maximization of human and computer performance
We present an efficient system for video search that maximizes the use of human bandwidth, while at the same time exploiting the machine’s ability to learn in real-time from use...
Alexander G. Hauptmann, Wei-Hao Lin, Rong Yan, Jun...
PLDI
2004
ACM
14 years 3 months ago
Symbolic pointer analysis revisited
Pointer analysis is a critical problem in optimizing compiler, parallelizing compiler, software engineering and most recently, hardware synthesis. While recent efforts have sugges...
Jianwen Zhu, Silvian Calman
CODES
2004
IEEE
14 years 1 months ago
Operation tables for scheduling in the presence of incomplete bypassing
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...
Aviral Shrivastava, Eugene Earlie, Nikil D. Dutt, ...
ATAL
2006
Springer
14 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...