Sciweavers

1583 search results - page 114 / 317
» Stability of Feature Selection Algorithms
Sort
View
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...
PODS
2002
ACM
168views Database» more  PODS 2002»
16 years 3 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
XSYM
2004
Springer
129views Database» more  XSYM 2004»
15 years 8 months ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
CIKM
2006
Springer
15 years 6 months ago
A comparative study on classifying the functions of web page blocks
In this paper, we study the problem of learning block classification models to estimate block functions. We distinguish general models, which are learned across multiple sites, an...
Xiangye Xiao, Qiong Luo, Xing Xie, Wei-Ying Ma