1278 search results - page 161 / 256 » The Complexity of Weighted Boolean |
SIGMETRICS
2010
ACM
14 years 3 months ago
2010
ACM
This paper studies under what conditions congestion control schemes can be both efficient, so that capacity is not wasted, and incentive compatible, so that each participant can m...
FOCS
1999
IEEE
14 years 3 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
HYBRID
1998
Springer
14 years 2 months ago
1998
Springer
We discuss properties of high order neurons in competitive learning. In such neurons, geometric shapes replace the role of classic `point' neurons in neural networks. Complex ...
ACCV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper, we address the problem of efficient human action detection with only one template. We choose the standard slidingwindow approach to scan the template video...
FOCS
1995
IEEE
14 years 2 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...