Sciweavers

2252 search results - page 133 / 451
» Improving Random Forests
Sort
View
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
14 years 4 days ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
RSA
2000
170views more  RSA 2000»
13 years 8 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
GLOBECOM
2009
IEEE
14 years 3 months ago
Random Linear Network Coding for Time-Division Duplexing: Field Size Considerations
Abstract— We study the effect of the field size on the performance of random linear network coding for time division duplexing channels proposed in [1]. In particular, we study ...
Daniel Enrique Lucani, Muriel Médard, Milic...
ACMSE
2009
ACM
14 years 2 months ago
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...
Travis Atkison
SASN
2004
ACM
14 years 1 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim