Sciweavers

4114 search results - page 623 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
WWW
2001
ACM
14 years 10 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
RECOMB
2004
Springer
14 years 9 months ago
Aligning alignments exactly
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Dean Starrett
ICCAD
2004
IEEE
155views Hardware» more  ICCAD 2004»
14 years 6 months ago
Robust analog/RF circuit design with projection-based posynomial modeling
In this paper we propose a RObust Analog Design tool (ROAD) for post-tuning analog/RF circuits. Starting from an initial design derived from hand analysis or analog circuit synthe...
Xin Li, Padmini Gopalakrishnan, Yang Xu, Lawrence ...
GLOBECOM
2007
IEEE
14 years 3 months ago
Performing Packet Content Inspection by Longest Prefix Matching Technology
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
Nen-Fu Huang, Yen-Ming Chu, Yen-Min Wu, Chia-Wen H...