4926 search results - page 906 / 986 » Two Graph Algorithms On an Associative Computing Model |
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
MM
2009
ACM
14 years 2 months ago
2009
ACM
How to measure and model the similarity between different music items is one of the most fundamental yet challenging research problems in music information retrieval. This paper ...