Sciweavers

1390 search results - page 22 / 278
» Computing the depth of a flat
Sort
View
COMGEO
2008
ACM
14 years 12 months ago
An optimal randomized algorithm for d-variate zonoid depth
A randomized linear expected-time algorithm for computing the zonoid depth (Dyckerhoff et al 1996, Mosler 2002) of a point with respect to a fixed dimensional point set is presente...
Pat Morin
FUIN
2000
115views more  FUIN 2000»
14 years 11 months ago
Constructing the Least Models for Positive Modal Logic Programs
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
Linh Anh Nguyen
CHI
2010
ACM
15 years 3 months ago
Artificial subtle expressions: intuitive notification methodology of artifacts
We describe artificial subtle expressions (ASEs) as intuitive notification methodology for artifacts' internal states for users. We prepared two types of audio ASEs; one was ...
Takanori Komatsu, Seiji Yamada, Kazuki Kobayashi, ...
CVPR
1999
IEEE
16 years 1 months ago
A Multi-View Approach to Motion and Stereo
This paper presents a new approach to computing dense depth and motion estimates from multiple images. Rather than computing a single depth or motion map from such a collection, w...
Richard Szeliski
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
15 years 3 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan