1378 search results - page 82 / 276 » The Tractability of Global Constraints |
158
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
In Kernel Fisher discriminant analysis (KFDA), we carry out Fisher linear discriminant analysis in a high dimensional feature space defined implicitly by a kernel. The performance...
143
click to vote
ICASSP
2008
IEEE
16 years 19 days ago
2008
IEEE
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
142
click to vote
TGC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a formal system that models programmable abstractions for access control. Composite abstractions and patterns of arbitrary complexity are modeled as a configu...
140
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
131
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We introduce a distributed and tractable mechanism for the allocation of continuously divisible resources to agents, that locally maximises the (Nash) product of their individual ...