Sciweavers

392 search results - page 50 / 79
» A unified framework for generalized Linear Discriminant Anal...
Sort
View
DAC
2006
ACM
14 years 8 months ago
A new LP based incremental timing driven placement for high performance designs
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
Tao Luo, David Newmark, David Z. Pan
CVPR
2010
IEEE
14 years 4 months ago
Efficient Additive Kernels via Explicit Feature Maps
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
Andrea Vedaldi, Andrew Zisserman
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 12 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ICNP
2005
IEEE
14 years 1 months ago
The Fundamental Role of Hop Distance in IEEE802.11 Multi-Hop Ad Hoc Networks
In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell)[1, 3]. The effects of nodes beyond t...
Yan Gao, Dah-Ming Chiu, John C. S. Lui
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 8 months ago
Web usage mining based on probabilistic latent semantic analysis
The primary goal of Web usage mining is the discovery of patterns in the navigational behavior of Web users. Standard approaches, such as clustering of user sessions and discoveri...
Xin Jin, Yanzan Zhou, Bamshad Mobasher