Sciweavers

26071 search results - page 5116 / 5215
» Making the
Sort
View
JMLR
2010
91views more  JMLR 2010»
13 years 4 months ago
Composite Binary Losses
We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the compos...
Mark D. Reid, Robert C. Williamson
JMLR
2010
206views more  JMLR 2010»
13 years 4 months ago
Learning Translation Invariant Kernels for Classification
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh, M...
JSA
2010
158views more  JSA 2010»
13 years 4 months ago
Scalable mpNoC for massively parallel systems - Design and implementation on FPGA
The high chip-level integration enables the implementation of large-scale parallel processing architectures with 64 and more processing nodes on a single chip or on an FPGA device...
Mouna Baklouti, Yassine Aydi, Philippe Marquet, Je...
LOGCOM
2010
152views more  LOGCOM 2010»
13 years 4 months ago
Constructive Logic with Strong Negation as a Substructural Logic
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
Manuela Busaniche, Roberto Cignoli
MST
2010
187views more  MST 2010»
13 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
« Prev « First page 5116 / 5215 Last » Next »