2899 search results - page 399 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
144
click to vote
SPAA
2010
ACM
15 years 10 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
174
Voted
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
178
click to vote
AAAI
2007
15 years 8 months ago
2007
Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low d...
194
click to vote
APNOMS
2008
Springer
15 years 7 months ago
2008
Springer
As network attacks have increased in number and severity over the past few years, intrusion detection system (IDS) is increasingly becoming a critical component to secure the netwo...
154
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...