16666 search results - page 2701 / 3334 » Descriptive and Computational Complexity |
224
click to vote
SIGMETRICS
2008
ACM
15 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
205
click to vote
SIGMOD
2008
ACM
15 years 7 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
196
click to vote
AAMAS
2005
Springer
15 years 7 months ago
2005
Springer
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
267
click to vote
AAMAS
2005
Springer
15 years 7 months ago
2005
Springer
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
186
click to vote
TIP
2008
15 years 7 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...