Sciweavers

3913 search results - page 782 / 783
» complexity 2006
Sort
View
PAMI
2008
155views more  PAMI 2008»
13 years 7 months ago
Subclass Problem-Dependent Design for Error-Correcting Output Codes
A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word fo...
Sergio Escalera, David M. J. Tax, Oriol Pujol, Pet...
FUIN
2008
108views more  FUIN 2008»
13 years 6 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel
ALGORITHMICA
2011
13 years 2 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
HOTI
2011
IEEE
12 years 7 months ago
iWISE: Inter-router Wireless Scalable Express Channels for Network-on-Chips (NoCs) Architecture
Abstract—Network-on-Chips (NoCs) paradigm is fast becoming a defacto standard for designing communication infrastructure for multicores with the dual goals of reducing power cons...
Dominic DiTomaso, Avinash Kodi, Savas Kaya, David ...
CP
2006
Springer
13 years 9 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer