7296 search results - page 1375 / 1460 » informs 2010 |
117
click to vote
SIGECOM
2010
ACM
15 years 6 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
123
click to vote
SIGMETRICS
2010
ACM
15 years 6 months ago
2010
ACM
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
116
Voted
SIGMETRICS
2010
ACM
15 years 6 months ago
2010
ACM
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
122
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
109
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...