3946 search results - page 332 / 790 » The computational complexity of choice sets |
214
click to vote
SSPR
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
214
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
171
click to vote
ICALP
2005
Springer
16 years 10 days ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
180
click to vote
ICN
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
191
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...