Sciweavers

493 search results - page 83 / 99
» Quantum Query Complexity of Some Graph Problems
Sort
View
157
Voted
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 1 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
DEXA
2000
Springer
132views Database» more  DEXA 2000»
15 years 2 months ago
Improving the Performance of High-Energy Physics Analysis through Bitmap Indices
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...
Kurt Stockinger, Dirk Düllmann, Wolfgang Hosc...
BMCBI
2008
96views more  BMCBI 2008»
14 years 9 months ago
Novel methodology for construction and pruning of quasi-median networks
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
Sarah C. Ayling, Terence A. Brown
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
INFOCOM
2010
IEEE
14 years 6 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...