Sciweavers

35419 search results - page 183 / 7084
» How are we doing
Sort
View
USENIX
2003
15 years 5 months ago
Operating System I/O Speculation: How Two Invocations Are Faster Than One
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
Keir Faser, Fay Chang
IPL
2007
72views more  IPL 2007»
15 years 4 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
CHI
2011
ACM
14 years 7 months ago
Computers can't give credit: how automatic attribution falls short in an online remixing community
In this paper, we explore the role that attribution plays in shaping user reactions to content reuse, or remixing, in a large user-generated content community. We present two stud...
Andrés Monroy-Hernández, Benjamin Ma...
VMV
2008
151views Visualization» more  VMV 2008»
15 years 5 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
FGR
2008
IEEE
147views Biometrics» more  FGR 2008»
15 years 10 months ago
Unsupervised clustering for google searches of celebrity images
How do we identify images of the same person in photo albums? How can we find images of a particular celebrity using web image search engines? These types of tasks require solvin...
Alex Holub, Pierre Moreels, Pietro Perona