4366 search results - page 678 / 874 » Learning and Smoothed Analysis |
SODA
2008
ACM
13 years 11 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
SODA
2007
ACM
13 years 11 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
AAAI
2004
13 years 11 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
AUSFORENSICS
2004
13 years 11 months ago
2004
The Snort intrusion detection system is a widely used and well-regarded open sourcesystem used for the detection of malicious activity in conventional wired networks. Recently, so...
CASCON
2006
13 years 11 months ago
2006
Automatically determining the situation of an ad-hoc group of people and devices within a smart environment is a significant challenge in pervasive computing systems. Current appro...