5624 search results - page 633 / 1125 » On Conditional Covering Problem |
172
click to vote
JSAC
2007
15 years 6 months ago
2007
Abstract— We consider both the single-user and the multiuser power allocation problems in MIMO systems, where the receiver side has the perfect channel state information (CSI), a...
166
click to vote
CAD
2000
Springer
15 years 6 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
181
click to vote
CORR
1998
Springer
15 years 6 months ago
1998
Springer
In this paper we consider the problem of theory patching, in which we are given a domain theory, some of whose components are indicated to be possibly awed, and a set of labeled t...
167
click to vote
SIAMDM
2010
15 years 4 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
164
click to vote
VLDB
2010
ACM
15 years 4 months ago
2010
ACM
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...