Sciweavers

1380 search results - page 165 / 276
» Computing the optimal strategy to commit to
Sort
View
AAAI
2011
12 years 8 months ago
Size Adaptive Selection of Most Informative Features
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
Si Liu, Hairong Liu, Longin Jan Latecki, Shuicheng...
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad
RECSYS
2009
ACM
14 years 2 months ago
Preference elicitation with subjective features
Utility or preference elicitation is a critical component in many recommender and decision support systems. However, most frameworks for elicitation assume a predefined set of fe...
Craig Boutilier, Kevin Regan, Paolo Viappiani
AINA
2008
IEEE
14 years 2 months ago
Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences
The common-use gap penalty strategies, constant penalty and affine gap penalty, have been adopted in the traditional three-sequence alignment algorithm which considers the inserti...
Che-Lun Hung, Chun-Yuan Lin, Yeh-Ching Chung, Chua...
CLUSTER
2008
IEEE
14 years 2 months ago
A multicore-enabled multirail communication engine
—The current trend in clusters architecture leads toward a massive use of multicore chips. This hardware evolution raises bottleneck issues at the network interface level. The us...
Elisabeth Brunet, François Trahay, Alexandr...