Sciweavers

2168 search results - page 292 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
ISBI
2006
IEEE
16 years 4 months ago
Early detection of rejection in cardiac MRI: a spectral graph approach
This paper develops an algorithm to detect abnormalities of small animals' transplanted hearts in MRI, at early stage of rejection when the hearts do not display prominent ab...
Chien Ho, Hsun-Hsien Chang, José M. F. Mour...
ADHOCNOW
2008
Springer
15 years 10 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
LICS
2007
IEEE
15 years 10 months ago
Limits of Multi-Discounted Markov Decision Processes
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...
Hugo Gimbert, Wieslaw Zielonka
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 9 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
141
Voted
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 9 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...