4908 search results - page 175 / 982 » On the Complexity of Optimal K-Anonymity |
170
click to vote
AAAI
2007
15 years 8 months ago
2007
Physically based rendering is the process of generating a 2D om the abstract description of a 3D Scene. Despite the development of various new techniques and algorithms, the compu...
146
click to vote
ANOR
2010
15 years 6 months ago
2010
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
164
click to vote
ICA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
184
click to vote
ICMLC
2010
Springer
15 years 4 months ago
2010
Springer
: Bagging (Bootstrap Aggregating) has been proved to be a useful, effective and simple ensemble learning methodology. In generic bagging methods, all the classifiers which are trai...
193
click to vote
ISCA
2005
IEEE
16 years 3 days ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...