Sciweavers

2434 search results - page 371 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
132
Voted
CP
2007
Springer
15 years 7 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ICDM
2007
IEEE
162views Data Mining» more  ICDM 2007»
15 years 7 months ago
Exploiting Network Structure for Active Inference in Collective Classification
Active inference seeks to maximize classification performance while minimizing the amount of data that must be labeled ex ante. This task is particularly relevant in the context o...
Matthew J. Rattigan, Marc Maier, David Jensen, Bin...
135
Voted
CORR
2008
Springer
125views Education» more  CORR 2008»
15 years 3 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
171
Voted
TNN
2008
152views more  TNN 2008»
15 years 3 months ago
Distributed Parallel Support Vector Machines in Strongly Connected Networks
We propose a distributed parallel support vector machine (DPSVM) training mechanism in a configurable network environment for distributed data mining. The basic idea is to exchange...
Yumao Lu, Vwani P. Roychowdhury, L. Vandenberghe
PR
2007
129views more  PR 2007»
15 years 2 months ago
EROS: Ensemble rough subspaces
Ensemble learning is attracting much attention from pattern recognition and machine learning domains for good generalization. Both theoretical and experimental researches show tha...
Qinghua Hu, Daren Yu, Zongxia Xie, Xiaodong Li