Sciweavers

177 search results - page 18 / 36
» Semidefinite Programming Relaxations for the Quadratic Assig...
Sort
View
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
14 years 3 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
ICML
2004
IEEE
14 years 10 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
ECML
2004
Springer
14 years 28 days ago
Efficient Hyperkernel Learning Using Second-Order Cone Programming
The kernel function plays a central role in kernel methods. Most existing methods can only adapt the kernel parameters or the kernel matrix based on empirical data. Recently, Ong e...
Ivor W. Tsang, James T. Kwok
NIPS
2000
13 years 10 months ago
Improved Output Coding for Classification Using Continuous Relaxation
Output coding is a general method for solving multiclass problems by reducing them to multiple binary classification problems. Previous research on output coding has employed, alm...
Koby Crammer, Yoram Singer
IOR
2008
62views more  IOR 2008»
13 years 9 months ago
Improved Bounds for the Symmetric Rendezvous Value on the Line
A notorious open problem in the field of rendezvous search is to decide the rendezvous value of the symmetric rendezvous search problem on the line, when the initial distance apar...
Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zulua...