Sciweavers

1132 search results - page 47 / 227
» Structural Average Case Complexity
Sort
View
TIT
2010
115views Education» more  TIT 2010»
13 years 3 months ago
On resource allocation in fading multiple-access channels-an efficient approximate projection approach
We consider the problem of rate and power allocation in a multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave ut...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
BMCBI
2010
83views more  BMCBI 2010»
13 years 9 months ago
An effective approach for generating a three-Cys2His2 zinc-finger-DNA complex model by docking
Background: Determination of protein-DNA complex structures with both NMR and X-ray crystallography remains challenging in many cases. High Ambiguity-Driven DOCKing (HADDOCK) is a...
Chun-Chi Chou, M. Rajasekaran, Chinpan Chen
INFOCOM
2011
IEEE
13 years 7 days ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
AAAI
2007
13 years 11 months ago
Finding Related Pages Using Green Measures: An Illustration with Wikipedia
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool. It is generic, ...
Yann Ollivier, Pierre Senellart
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 3 months ago
Equilibria of Dynamic Games with Many Players: Existence, Approximation, and Market Structure
In this paper we study stochastic dynamic games with many players that are relevant for a wide range of social, economic, and engineering applications. The standard solution conce...
Sachin Adlakha, Ramesh Johari, Gabriel Y. Weintrau...