Sciweavers

23119 search results - page 4427 / 4624
» From Domain to Requirements
Sort
View
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 11 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
SPAA
2010
ACM
15 years 11 months ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
SYSTOR
2010
ACM
15 years 11 months ago
On the DMA mapping problem in direct device assignment
I/O intensive workloads running in virtual machines can suffer massive performance degradation. Direct assignment of I/O devices to virtual machines is the best performing I/O vir...
Ben-Ami Yassour, Muli Ben-Yehuda, Orit Wasserman
CIVR
2010
Springer
160views Image Analysis» more  CIVR 2010»
15 years 11 months ago
Today's and tomorrow's retrieval practice in the audiovisual archive
Content-based video retrieval is maturing to the point where it can be used in real-world retrieval practices. One such practice is the audiovisual archive, whose users increasing...
Bouke Huurnink, Cees G. M. Snoek, Maarten de Rijke...
ICALP
2010
Springer
15 years 11 months ago
Additive Spanners in Nearly Quadratic Time
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
David P. Woodruff
« Prev « First page 4427 / 4624 Last » Next »