Sciweavers

CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
Improving Term Extraction Using Particle Swarm Optimization Techniques
: Problem statement: Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatica...
Mohammad Syafrullah, Naomie Salim
CORR
2010
Springer
159views Education» more  CORR 2010»
13 years 7 months ago
An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
We provide an alternative proof for the capacity region of the degraded Gaussian multiple-input multiple-output (MIMO) broadcast channel. Our proof does not use the channel enhanc...
Ersen Ekrem, Sennur Ulukus
CORR
2010
Springer
154views Education» more  CORR 2010»
13 years 7 months ago
Causal Markov condition for submodular information measures
The causal Markov condition (CMC) is a postulate that links observations to causality. It describes the conditional independences among the observations that are entailed by a cau...
Bastian Steudel, Dominik Janzing, Bernhard Sch&oum...
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
A fuzzified BRAIN algorithm for learning DNF from incomplete data
Aim of this paper is to address the problem of learning Boolean functions from training data with missing values. We present an extension of the BRAIN algorithm, called U-BRAIN (U...
Salvatore Rampone, Ciro Russo
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 7 months ago
FPGA Implementation of LS Code Generator for CDM Based MIMO Channel Sounder
MIMO (Multi Input Multi Output) wireless communication system is an innovative solution to improve the bandwidth efficiency by exploiting multipath-richness of the propagation envi...
M. Habib Ullah, Md. Niamul Bari, A. Unggul Prianto...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 7 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
CORR
2010
Springer
72views Education» more  CORR 2010»
13 years 7 months ago
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Prahladh Harsha, Moses Charikar, Matthew Andrews, ...
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 7 months ago
Extended Range Telepresence for Evacuation Training in Pedestrian Simulations
Abstract: In this contribution, we propose a new framework to evaluate pedestrian simulations by using Extended Range Telepresence. Telepresence is used as a virtual reality walkin...
Antonia Pérez Arias, Uwe D. Hanebeck, Peter...
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
Lila Kari, Benoît Masson
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj