Sciweavers

1368 search results - page 135 / 274
» Generalized Rook Polynomials
Sort
View
JACM
2007
132views more  JACM 2007»
15 years 4 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
CORR
2002
Springer
166views Education» more  CORR 2002»
15 years 4 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
174
Voted
SIAMREV
2010
132views more  SIAMREV 2010»
14 years 11 months ago
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...
Ivo Babuska, Fabio Nobile, Raúl Tempone
193
Voted
TASE
2010
IEEE
14 years 11 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
141
Voted
TIT
2010
115views Education» more  TIT 2010»
14 years 11 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...