Sciweavers

2252 search results - page 415 / 451
» Improving Random Forests
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
On Secure Multi-party Computation in Black-Box Groups
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxio...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
14 years 3 months ago
Genetic algorithms for large join query optimization
Genetic algorithms (GAs) have long been used for large join query optimization (LJQO). Previous work takes all queries as based on one granularity to optimize GAs and compares the...
Hongbin Dong, Yiwen Liang
GFKL
2007
Springer
152views Data Mining» more  GFKL 2007»
14 years 3 months ago
Supporting Web-based Address Extraction with Unsupervised Tagging
Abstract. The manual acquisition and modeling of tourist information as e.g. addresses of points of interest is time and, therefore, cost intensive. Furthermore, the encoded inform...
Berenike Loos, Chris Biemann
IPSN
2007
Springer
14 years 3 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
14 years 3 months ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...