Sciweavers

513 search results - page 80 / 103
» Finitely Based, Finite Sets of Words
Sort
View
CORR
2008
Springer
161views Education» more  CORR 2008»
13 years 7 months ago
Compressed Sensing of Analog Signals
Abstract--A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on ...
Yonina C. Eldar
FOCS
2010
IEEE
13 years 6 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
JSC
2006
52views more  JSC 2006»
13 years 8 months ago
Markov bases of three-way tables are arbitrarily complicated
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonn...
Jesús A. De Loera, Shmuel Onn
TSP
2008
116views more  TSP 2008»
13 years 8 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
EDBT
2006
ACM
144views Database» more  EDBT 2006»
14 years 8 months ago
Towards Expressive Publish/Subscribe Systems
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...
Alan J. Demers, Johannes Gehrke, Mingsheng Hong, M...