Sciweavers

1252 search results - page 196 / 251
» Foundations of Similarity and Utility
Sort
View
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 10 months ago
An Agent-Based Best Effort Routing Technique for Load Balancing
Abstract. Several best effort schemes (next-hop routing) are used to transport the data in the Internet. Some of them do not perform flexible route computations to cope up with the...
Sunilkumar S. Manvi, Pallapa Venkataram
JNW
2008
101views more  JNW 2008»
13 years 10 months ago
Computational Time-Division and Code-Division Channel Access Scheduling in Ad Hoc Networks
Using two-hop neighborhood information, we present the hybrid activation multiple access (HAMA) protocol for time-division channel access scheduling in ad hoc networks with omni-di...
Lichun Bao, J. J. Garcia-Luna-Aceves
DATAMINE
2007
93views more  DATAMINE 2007»
13 years 10 months ago
Evaluation of ordinal attributes at value level
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
Marko Robnik-Sikonja, Koen Vanhoof
JSAC
2008
133views more  JSAC 2008»
13 years 10 months ago
Distributed Rule-Regulated Spectrum Sharing
Dynamic spectrum access is a promising technique to use spectrum efficiently. Without being restricted to any prefixed spectrum bands, nodes choose operating spectrum ondemand. Suc...
Lili Cao, Haitao Zheng
NN
2006
Springer
153views Neural Networks» more  NN 2006»
13 years 10 months ago
An incremental network for on-line unsupervised classification and topology learning
This paper presents an on-line unsupervised learning mechanism for unlabeled data that are polluted by noise. Using a similarity thresholdbased and a local error-based insertion c...
Shen Furao, Osamu Hasegawa