Sciweavers

SIAMCO
2010
115views more  SIAMCO 2010»
13 years 6 months ago
Identification of Hammerstein Systems with Quantized Observations
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
Yanlong Zhao, Ji-Feng Zhang, Le Yi Wang, Gang Geor...
RTS
2010
175views more  RTS 2010»
13 years 6 months ago
Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
Safety-critical real-time standards define several criticality levels for the tasks (e.g., DO-178B - Software Considerations in Airborne Systems and Equipment Certification). Clas...
François Dorin, Pascal Richard, Michaë...
PERCOM
2010
ACM
13 years 6 months ago
Local map generation using position and communication history of mobile nodes
In this paper, we propose an algorithm to estimate 2D shapes and positions of obstacles such as buildings using GPS and wireless communication history of mobile nodes. Our algorith...
Shinichi Minamimoto, Sae Fujii, Hirozumi Yamaguchi...
PAMI
2010
190views more  PAMI 2010»
13 years 6 months ago
Linear Regression for Face Recognition
In this paper, we present a novel approach of face identification by formulating the pattern recognition problem in terms of linear regression. Using a fundamental concept that pat...
Imran Naseem, Roberto Togneri, Mohammed Bennamoun
PAMI
2010
162views more  PAMI 2010»
13 years 6 months ago
Differential Earth Mover's Distance with Its Applications to Visual Tracking
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
Qi Zhao, Zhi Yang, Hai Tao
MLDM
2010
Springer
13 years 6 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
ML
2010
ACM
163views Machine Learning» more  ML 2010»
13 years 6 months ago
Classification with guaranteed probability of error
We introduce a general-purpose learning machine that we call the Guaranteed Error Machine, or GEM, and two learning algorithms, a real GEM algorithm and an ideal GEM algorithm. Th...
Marco C. Campi
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 6 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
MEMICS
2010
13 years 6 months ago
A Simple Topology Preserving Max-Flow Algorithm for Graph Cut Based Image Segmentation
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
Ondrej Danek, Martin Maska
JUCS
2010
133views more  JUCS 2010»
13 years 6 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica