Sciweavers

2252 search results - page 188 / 451
» Improving Random Forests
Sort
View
116
Voted
ISCAS
2005
IEEE
124views Hardware» more  ISCAS 2005»
15 years 8 months ago
One-pass computation-aware motion estimation with adaptive search strategy
— A computation-aware motion estimation algorithm is proposed in this paper. Its goal is to find the best block matching results in a computation-limited and computation-variant...
Yu-Wen Huang, Chia-Lin Lee, Ching-Yeh Chen, Liang-...
112
Voted
BERTINORO
2005
Springer
15 years 8 months ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
107
Voted
FC
2005
Springer
87views Cryptology» more  FC 2005»
15 years 8 months ago
Protecting Secret Data from Insider Attacks
We consider defenses against confidentiality and integrity attacks on data following break-ins, or so-called intrusion resistant storage technologies. We investigate the problem o...
David Dagon, Wenke Lee, Richard J. Lipton
128
Voted
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 8 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
122
Voted
ECCV
2010
Springer
15 years 8 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...