Publications related to Conjectures on an algorithm for convex parametric quadratic programs

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Jorge Miguel Dias Almeida Rodrigues Soares

Opportunistic wireless sensor networks (WSNs) have recently been proposed as solutions for many remote monitoring problems. Many such problems, including environmental monitoring, involve large deployment scenarios with lower-than-average node density, as ...

2011

Nonlinear Average Consensus

Martin Hasler, Leonidas Georgopoulos

We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorith ...

IEICE2009

Detecting the Origin of Text Segments Efficiently

Monika Henzinger

In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...

ACM2009

Neighbor Discovery in Wireless Networks and the Coupon Collector's Problem

Ramin Khalili

Neighbor discovery is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discovery in wireless networks. We first consider an ALOHA-like neighbor discovery algor ...

2009

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

Lei Zhang, Yann Christinat

Many different methods exist for pattern detection in gene expression data. In contrast to classical methods, biclustering has the ability to cluster a group of genes together with a group of conditions (replicates, set of patients, or drug compounds). How ...

2008

A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity

George Candea, Horatiu Jula

We introduce the concept of deadlock immunity—a program's ability to avoid all deadlocks that match patterns of deadlocks experienced in the past. We present here an algorithm for enabling large software systems to automatically acquire such immunity witho ...

2008

Optimal maneuvering of seismic sensors for localization of subsurface targets

Volkan Cevher

We consider the problem of detecting and locating buried land mines and subsurface objects by using a maneuvering array that receives scattered seismic surface waves. We demonstrate an adaptive system that moves an array of receivers according to an optima ...

Institute of Electrical and Electronics Engineers2007

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named

H _{ 2 }

O, is easy to implement and is perfectly reversible using the same algorithm to ...

IEEE2007

VLSI implementation of the list sphere algorithm

Andreas Peter Burg, Matthieu Philippe Emmanuel Zellweger, Christoph Studer

Sphere decoding (SD) is widely considered as one of the most promising detection schemes for multiple-input multiple-output (MIMO) communication systems. The recently proposed list sphere-decoding (LSD) algorithm is an extension of the original SD algorith ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

An online throughput-competitive algorithm for multicast routing and admission control

Monika Henzinger, Ashish Goel

We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...

2005

Conjectures on an algorithm for convex parametric quadratic programs

Graph Chatbot

Chat with Graph Search

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Nonlinear Average Consensus

Detecting the Origin of Text Segments Efficiently

Neighbor Discovery in Wireless Networks and the Coupon Collector's Problem

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity

Optimal maneuvering of seismic sensors for localization of subsurface targets

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

VLSI implementation of the list sphere algorithm

An online throughput-competitive algorithm for multicast routing and admission control

Neighbor Discovery in Wireless Networks and the Coupon Collector's Problem

Detecting the Origin of Text Segments Efficiently

Opportunistic Data Collection in Sparse Wireless Sensor Networks

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

VLSI implementation of the list sphere algorithm

An online throughput-competitive algorithm for multicast routing and admission control

Nonlinear Average Consensus

A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity

Optimal maneuvering of seismic sensors for localization of subsurface targets

$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering