7742 search results - page 392 / 1549 » The Robustness of Level Sets |
166
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— We analyze fading relay networks, where a singleantenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop...
174
click to vote
JGO
2008
15 years 6 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...
201
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Background subtraction in dynamic scenes is an important and challenging task. In this paper, we present a novel and effective method for dynamic background subtraction based on c...
196
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations ...
222
click to vote
ICMI
2004
Springer
16 years 8 days ago
2004
Springer
The interaction between human beings and computers will be more natural if computers are able to perceive and respond to human non-verbal communication such as emotions. Although ...