Person

Razvan Cristescu

This person is no longer with EPFL

Related publications (18)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Power-Efficient Sensor Placement and Transmission Structure for Data Gathering under Distortion Constraints

Razvan Cristescu

We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be recon structed at a sink within specified distortion bounds wh ...

2004

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a sink to which the data from all the sources has to arrive. We address the minimization of a separable joint communication cost function given by the product [rate]

\times

[edge ...

2004

Networked Slepian-Wolf: Theory and Algorithms

Martin Vetterli, Razvan Cristescu

In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes ...

Springer Verlag2004

Networked Slepian-Wolf: Theory and Algorithms

Martin Vetterli, Razvan Cristescu

2004

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Power Efficient Gathering of Correlated Data: Optimization, NP-Completeness and Heuristics

Martin Vetterli, Razvan Cristescu

This paper studies the interaction between the communication costs in a sensor network and the structure of the data that it measures. We formulate an optimization problem definition for power efficient data gathering and assess its computational difficult ...

2003

A convergence theorem for controlled queues with partial observations

Razvan Cristescu

We consider a queuing problem in which both the service rate of a finite-buffer queue and its rate of arrivals are functions of the same partially observed Markov chain. Basic performance indices of this device, such as long term throughput and loss rates, ...

2002

Flow control for multiple access queues

Razvan Cristescu

We study the problem of finding a characterization for the channel that results when a queue is operated under multiple access conditions. In such systems, the mechanism by which different sources gain access to the channel plays a fundamental role in defi ...

2001

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

\times

[edge ...

2004