Sciweavers

1187 search results - page 132 / 238
» The Generalized Dimensionality Reduction Problem
Sort
View
63
Voted
CORR
2010
Springer
65views Education» more  CORR 2010»
14 years 10 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
AAAI
1993
14 years 11 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
IUI
2003
ACM
15 years 3 months ago
A reliable natural language interface to household appliances
As household appliances grow in complexity and sophistication, they become harder and harder to use, particularly because of their tiny display screens and limited keyboards. This...
Alexander Yates, Oren Etzioni, Daniel S. Weld
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
15 years 10 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
15 years 7 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...