Sciweavers

1298 search results - page 162 / 260
» The online set cover problem
Sort
View
PVLDB
2010
100views more  PVLDB 2010»
15 years 1 months ago
Efficient Proximity Detection among Mobile Users via Self-Tuning Policies
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean...
Man Lung Yiu, Leong Hou U, Simonas Saltenis, Kosta...
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
15 years 1 months ago
On parameterized Lyapunov and control Lyapunov functions for discrete-time systems
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
Mircea Lazar, Rob H. Gielen
ICC
2008
IEEE
138views Communications» more  ICC 2008»
16 years 27 days ago
Localization of IP Links Faults Using Overlay Measurements
—Accurate fault detection and localization is essential to the efficient and economical operation of ISP networks. In addition, it affects the performance of Internet applicatio...
Mohammad Fraiwan, Manimaran Manimaran
ICPR
2008
IEEE
16 years 27 days ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
CSREASAM
2006
15 years 7 months ago
An Efficient Bloom Filter Based Solution for Multiparty Private Matching
- The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while prot...
Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. ...