Sciweavers

398 search results - page 33 / 80
» Query by output
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 11 days ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
DAMON
2007
Springer
15 years 6 months ago
Parallel buffers for chip multiprocessors
Chip multiprocessors (CMPs) present new opportunities for improving database performance on large queries. Because CMPs often share execution, cache, or bandwidth resources among ...
John Cieslewicz, Kenneth A. Ross, Ioannis Giannaka...
COLT
1998
Springer
15 years 4 months ago
Self Bounding Learning Algorithms
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
Yoav Freund
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 1 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
PCM
2005
Springer
141views Multimedia» more  PCM 2005»
15 years 5 months ago
Automatic Photo Indexing Based on Person Identity
In this paper, we propose a novel approach to automatically index digital home photos based on person identity. A person is identified by his/her face and clothes. The proposed met...
Seungji Yang, Kyong Sok Seo, Sang Kim, Yong Man Ro...