Sciweavers

3946 search results - page 757 / 790
» The computational complexity of choice sets
Sort
View
JSAC
2007
104views more  JSAC 2007»
15 years 4 months ago
Tomlinson-Harashima Precoding for Broadcast Channels with Uncertainty
— We consider the design of Tomlinson-Harashima (TH) precoders for broadcast channels in the presence of channel uncertainty. For systems in which uplink-downlink reciprocity is ...
Michael Botros Shenouda, Timothy N. Davidson
CN
2000
128views more  CN 2000»
15 years 4 months ago
The Network Workbench: network simulation software for academic investigation of Internet concepts
Simulation offers significant advantages as a basis for academic projects in computer networking. many unimportant details can be abstracted away, and also because simulations can...
J. Mark Pullen
TCS
1998
15 years 4 months ago
A Uniform Approach to Semi-Dynamic Problems on Digraphs
In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...
Serafino Cicerone, Daniele Frigioni, Umberto Nanni...
TKDE
1998
139views more  TKDE 1998»
15 years 4 months ago
Distributed Optimistic Concurrency Control Methods for High-Performance Transaction Processing
—There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency an...
Alexander Thomasian
TOG
2002
212views more  TOG 2002»
15 years 4 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...