2168 search results - page 103 / 434 » Randomized Algorithms and Complexity Theory |
141
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
121
click to vote
COCO
2007
Springer
15 years 9 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...
121
click to vote
CCS
2004
ACM
15 years 8 months ago
2004
ACM
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
161
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
152
click to vote
SSPR
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...