Sciweavers

2681 search results - page 422 / 537
» Problem F
Sort
View
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
13 years 9 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
SIAMCO
2002
86views more  SIAMCO 2002»
13 years 9 months ago
On the Observability and Detectability of Continuous-Time Markov Jump Linear Systems
The paper introduces a new detectability concept for continuous-time Markov jump linear systems with finite Markov space that generalizes previous concepts found in the literature....
Eduardo F. Costa, João Bosco Ribeiro do Val
SIGMETRICS
2002
ACM
103views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
Network tomography on general topologies
In this paper we consider the problem of inferring link-level loss rates from end-to-end multicast measurements taken from a collection of trees. We give conditions under which lo...
Tian Bu, Nick G. Duffield, Francesco Lo Presti, Do...
SP
2002
IEEE
141views Security Privacy» more  SP 2002»
13 years 9 months ago
Collaborative Filtering with Privacy
Server-based collaborative filtering systems have been very successful in e-commerce and in direct recommendation applications. In future, they have many potential applications in...
John F. Canny
TASLP
2002
84views more  TASLP 2002»
13 years 9 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales