325 search results - page 65 / 65 » Alternatives to two classic data structures |
TIFS
2008
13 years 5 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
CHI
2011
ACM
12 years 9 months ago
2011
ACM
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...
ICDAR
2011
IEEE
12 years 5 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
DIS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
SIAMCOMP
1998
13 years 5 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...