Sciweavers

3894 search results - page 451 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
15 years 8 months ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
IJCAI
2007
15 years 6 months ago
Scalable Diagnosability Checking of Event-Driven Systems
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...
Anika Schumann, Yannick Pencolé
JSAC
2006
79views more  JSAC 2006»
15 years 4 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
ICASSP
2011
IEEE
14 years 8 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
ICC
2007
IEEE
217views Communications» more  ICC 2007»
15 years 11 months ago
Decentralized Activation in a ZigBee-enabled Unattended Ground Sensor Network: A Correlated Equilibrium Game Theoretic Analysis
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
Michael Maskery, Vikram Krishnamurthy