Sciweavers

2229 search results - page 194 / 446
» Comparative analysis of biclustering algorithms
Sort
View
CIG
2005
IEEE
15 years 6 months ago
Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
Nanlin Jin, Edward P. K. Tsang
RTSS
1994
IEEE
15 years 5 months ago
Efficient Aperiodic Service Under Earliest Deadline Scheduling
In this paper we present four new on-line algorithms for servicing soft aperiodic requests in real-time systems, where a set of hard periodic lash is scheduled using the Earliest ...
Marco Spuri, Giorgio C. Buttazzo
VLDB
1994
ACM
140views Database» more  VLDB 1994»
15 years 5 months ago
Efficient and Effective Clustering Methods for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. In this paper, we explore whether clustering ...
Raymond T. Ng, Jiawei Han
COMPGEOM
2005
ACM
15 years 3 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
ICASSP
2011
IEEE
14 years 4 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...