Sciweavers

247 search results - page 12 / 50
» On Finding Large Conjunctive Clusters
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Feature selection focused within error clusters
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
Henry S. Baird, Sui-Yu Wang
IPPS
1998
IEEE
13 years 11 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
We propose a factor-graph-based approach to joint channel-estimationand-decoding of bit-interleaved coded orthogonal frequency division multiplexing (BICM-OFDM). In contrast to ex...
Philip Schniter
HICSS
2006
IEEE
133views Biometrics» more  HICSS 2006»
14 years 1 months ago
Being Literate with Large Document Collections: Observational Studies and Cost Structure Tradeoffs
How do people work with large document collections? We studied the effects of different kinds of analysis tools on the behavior of people doing rapid large-volume data assessment,...
Daniel M. Russell, Malcolm Slaney, Yan Qu, Mave Ho...