Sciweavers

1439 search results - page 122 / 288
» Bagging with Adaptive Costs
Sort
View
IPM
2007
114views more  IPM 2007»
13 years 9 months ago
s-grams: Defining generalized n-grams for information retrieval
For European languages, n-gram has proved to be the cost effective alternative to morphological processing during indexing task and it has been studied and analyzed extensively us...
Anni Järvelin, Antti Järvelin, Kalervo J...
IJON
1998
87views more  IJON 1998»
13 years 8 months ago
Learned parametric mixture based ICA algorithm
The learned parametric mixture method is presented for a canonical cost function based ICA model on linear mixture, with several new findings. First, its adaptive algorithm is fu...
Lei Xu, Chi Chiu Cheung, Shun-ichi Amari
P2P
2010
IEEE
202views Communications» more  P2P 2010»
13 years 7 months ago
Optimizing Near Duplicate Detection for P2P Networks
—In this paper, we propose a probabilistic algorithm for detecting near duplicate text, audio, and video resources efficiently and effectively in large-scale P2P systems. To thi...
Odysseas Papapetrou, Sukriti Ramesh, Stefan Siersd...
GI
2009
Springer
13 years 7 months ago
An Improved Method for creating Shared Belief in Communication Constrained Sensor Networks
: Networked systems that gather sensor data in order to react to phenomena in their surroundings are faced with a growing need for adaptive behavior to operate in dynamically chang...
Eelke van Foeken, Peter Hiemstra, Leon Kester
INFOCOM
2012
IEEE
12 years 7 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...