Sciweavers

3208 search results - page 244 / 642
» A Lower Bound for Primality
Sort
View
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 6 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
Qualitative Visualization of Distance Information
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
Jobst Heitzig
DM
1999
101views more  DM 1999»
15 years 6 months ago
Characterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dym&ag...
TIT
2011
98views more  TIT 2011»
15 years 1 months ago
Information Rates for Multiantenna Systems With Unknown Fading
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
Krishnan Padmanabhan, Sundeep Venkatraman, Oliver ...
JMLR
2010
155views more  JMLR 2010»
15 years 1 months ago
Bayesian Gaussian Process Latent Variable Model
We introduce a variational inference framework for training the Gaussian process latent variable model and thus performing Bayesian nonlinear dimensionality reduction. This method...
Michalis Titsias, Neil D. Lawrence