Sciweavers

2825 search results - page 205 / 565
» Robust Feature Selection Algorithms
Sort
View
125
Voted
CCS
2010
ACM
15 years 9 months ago
Bureaucratic protocols for secure two-party sorting, selection, and permuting
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
Guan Wang, Tongbo Luo, Michael T. Goodrich, Wenlia...
PERCOM
2010
ACM
15 years 1 months ago
All for one or one for all? Combining heterogeneous features for activity spotting
Abstract—Choosing the right feature for motion based activity spotting is not a trivial task. Often, features derived by intuition or that proved to work well in previous work ar...
Ulf Blanke, Bernt Schiele, Matthias Kreil, Paul Lu...
164
Voted
PODS
2002
ACM
168views Database» more  PODS 2002»
16 years 2 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
178
Voted
WWW
2010
ACM
15 years 2 months ago
Cross-domain sentiment classification via spectral feature alignment
Sentiment classification aims to automatically predict sentiment polarity (e.g., positive or negative) of users publishing sentiment data (e.g., reviews, blogs). Although traditio...
Sinno Jialin Pan, Xiaochuan Ni, Jian-Tao Sun, Qian...
138
Voted
CGF
2008
201views more  CGF 2008»
15 years 2 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt