Sciweavers

1451 search results - page 166 / 291
» Order independence and rationalizability
Sort
View
ICA
2004
Springer
15 years 11 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
IWQOS
2004
Springer
15 years 11 months ago
Robust communications for sensor networks in hostile environments
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...
Ossama Younis, Sonia Fahmy, Paolo Santi
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
15 years 11 months ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
164
Voted
ICTAI
2002
IEEE
15 years 11 months ago
Distributed Graphplan
(Appears as a regular paper in the Proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Washington D.C, IEEE Computer Society, Nov. 2002, p...
Mark Iwen, Amol Dattatraya Mali
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
15 years 10 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder