Sciweavers

1068 search results - page 151 / 214
» Extremely randomized trees
Sort
View
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 12 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
EVOW
2008
Springer
13 years 11 months ago
Architecture Performance Prediction Using Evolutionary Artificial Neural Networks
The design of computer architectures requires the setting of multiple parameters on which the final performance depends. The number of possible combinations make an extremely huge ...
Pedro A. Castillo, Antonio Miguel Mora, Juan Juli&...
ICWN
2004
13 years 11 months ago
QoS Support in Wireless Sensor Networks: A Survey
In this paper, we assess the state of the art of Quality of Services (QoS) support in wireless sensor networks (WSNs). Unlike traditional end-to-end multimedia applications, many n...
Dazhi Chen, Pramod K. Varshney
ICML
2010
IEEE
13 years 11 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 10 months ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler