2168 search results - page 415 / 434 » Randomized Algorithms and Complexity Theory |
117
Voted
DAGSTUHL
2007
15 years 1 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
201
click to vote
PODS
2009
ACM
16 years 6 days ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
CVPR
1998
IEEE
16 years 1 months ago
1998
IEEE
In this paper we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction...
108
click to vote
KDD
2007
ACM
16 years 2 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
CHI
2007
ACM
16 years 1 days ago
2007
ACM
We present the case study of a complex, mixed-initiative scheduling system to illustrate Work-Centered Design (WCD), a new approach for the design of information systems. WCD is b...