Sciweavers

2705 search results - page 53 / 541
» Splitting the sensor node
Sort
View
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 7 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...
ICDCSW
2005
IEEE
15 years 10 months ago
Bandwidth Clustering for Reliable and Prioritized Network Routing Using Split Agent-Based Method
Recent researches have highlighted the importance of developing a network with distributed problem solving abilities thus enhancing reliability with equal share of network resourc...
Constandinos X. Mavromoustakis, Helen D. Karatza
HOTI
2002
IEEE
15 years 9 months ago
Distributed-and-Split Data-Control Extension to SCSI for Scalable Storage Area Networks
A “Storage-Area Network” (SAN) comprises computers (“Initiators”), storage “block devices” (“Targets”), and a Controller(s). Most SANs use the SCSI protocol over v...
Yitzhak Birk, Nafea Bishara
ICANNGA
2007
Springer
100views Algorithms» more  ICANNGA 2007»
15 years 8 months ago
Softening Splits in Decision Trees Using Simulated Annealing
Predictions computed by a classification tree are usually constant on axis-parallel hyperrectangles corresponding to the leaves and have strict jumps on their boundaries. The densi...
Jakub Dvorák, Petr Savický
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 1 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...