Sciweavers

217 search results - page 18 / 44
» Selecting Cryptographic Key Sizes
Sort
View
PODS
2005
ACM
118views Database» more  PODS 2005»
14 years 8 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
COMCOM
2006
86views more  COMCOM 2006»
13 years 8 months ago
Study on nominee selection for multicast congestion control
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design...
Feng Xie, Gang Feng, Chee Kheong Siew
ICCV
2003
IEEE
14 years 10 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
CSDA
2007
105views more  CSDA 2007»
13 years 8 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 5 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...