Sciweavers

3894 search results - page 684 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
HPCC
2005
Springer
15 years 8 months ago
Detonation Structure Simulation with AMROC
Abstract. Numerical simulations can be the key to the thorough understanding of the multi-dimensional nature of transient detonation waves. But the accurate approximation of realis...
Ralf Deiterding
SSD
2005
Springer
173views Database» more  SSD 2005»
15 years 8 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
ATAL
2003
Springer
15 years 8 months ago
Transition-independent decentralized markov decision processes
There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of m...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
152
Voted
PG
2000
IEEE
15 years 7 months ago
Morphing Using Curves and Shape Interpolation Techniques
This paper presents solutions to the feature correspondence and feature interpolation problems in image morphing. The user specifies the correspondence between the source and the...
Henry Johan, Yuichi Koiso, Tomoyuki Nishita
127
Voted
PKDD
1999
Springer
118views Data Mining» more  PKDD 1999»
15 years 7 months ago
Mining Possibilistic Set-Valued Rules by Generating Prime Disjunctions
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
Alexandr A. Savinov