3656 search results - page 395 / 732 » Compact Location Problems |
223
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
167
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...
194
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
220
click to vote
NIPS
2003
15 years 8 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
180
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...