2168 search results - page 395 / 434 » Randomized Algorithms and Complexity Theory |
127
Voted
ISPA
2005
Springer
15 years 8 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
130
click to vote
DAC
2004
ACM
16 years 3 months ago
2004
ACM
It has been widely recognized that the dynamic range information of an application can be exploited to reduce the datapath bitwidth of either processors or ASICs, and therefore th...
140
Voted
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
123
click to vote
CIDM
2009
IEEE
15 years 9 months ago
2009
IEEE
— Both theory and a wealth of empirical studies have established that ensembles are more accurate than single predictive models. Unfortunately, the problem of how to maximize ens...
154
click to vote
MIR
2004
ACM
15 years 8 months ago
2004
ACM
In content-based image retrieval, relevance feedback has been introduced to narrow the gap between low-level image feature and high-level semantic concept. Furthermore, to speed u...