Sciweavers

12101 search results - page 2339 / 2421
» Mutual Information Analysis
Sort
View
109
Voted
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 5 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 5 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu
94
Voted
SIGECOM
2010
ACM
219views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Revenue maximization with a single sample
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan
105
Voted
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
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...
Ashish Goel, Pankaj Gupta
105
Voted
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
15 years 5 months ago
Finding maximal cliques in massive networks by H*-graph
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...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
« Prev « First page 2339 / 2421 Last » Next »