Sciweavers

4007 search results - page 792 / 802
» Computation with imprecise probabilities
Sort
View
JCB
2002
70views more  JCB 2002»
13 years 7 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
TON
2002
75views more  TON 2002»
13 years 7 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
WWW
2002
ACM
13 years 7 months ago
Improvement of HITS-based algorithms on web documents
In this paper, we present two ways to improve the precision of HITS-based algorithms on Web documents. First, by analyzing the limitations of current HITS-based algorithms, we pro...
Longzhuang Li, Yi Shang, Wei Zhang
COMCOM
2007
149views more  COMCOM 2007»
13 years 7 months ago
Adaptive security design with malicious node detection in cluster-based sensor networks
Distributed wireless sensor networks have problems on detecting and preventing malicious nodes, which always bring destructive threats and compromise multiple sensor nodes. Theref...
Meng-Yen Hsieh, Yueh-Min Huang, Han-Chieh Chao
PRL
2007
138views more  PRL 2007»
13 years 7 months ago
Ent-Boost: Boosting using entropy measures for robust object detection
Recently, boosting has come to be used widely in object-detection applications because of its impressive performance in both speed and accuracy. However, learning weak classifier...
Duy-Dinh Le, Shin'ichi Satoh