Sciweavers

11345 search results - page 137 / 2269
» Foundations of Computer Science
Sort
View
JOC
2002
76views more  JOC 2002»
14 years 11 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
COMPGEOM
2003
ACM
15 years 4 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
VLC
2008
314views more  VLC 2008»
14 years 11 months ago
A survey of methods for image annotation
In order to evaluate automated image annotation and object recognition algorithms, ground truth in the form of a set of images correctly annotated with text describing each image ...
Allan Hanbury
SIGCSE
2010
ACM
121views Education» more  SIGCSE 2010»
15 years 6 months ago
Using strategies for assessment of programming exercises
Programming exercise assessment tools alleviate the task of teachers, and increase consistency of markings. Many programming exercise assessment tools are based on testing. A test...
Alex Gerdes, Johan Jeuring, Bastiaan Heeren