Sciweavers

484 search results - page 76 / 97
» The number of convex permutominoes
Sort
View
ACML
2009
Springer
14 years 2 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
CISS
2007
IEEE
14 years 2 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
CINQ
2004
Springer
133views Database» more  CINQ 2004»
14 years 1 months ago
Inductive Querying for Discovering Subgroups and Clusters
We introduce the problem of cluster-grouping and show that it integrates several important data mining tasks, i.e. subgroup discovery, mining correlated patterns and aspects from c...
Albrecht Zimmermann, Luc De Raedt
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 1 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
AAAI
2008
14 years 16 days ago
Online Learning with Expert Advice and Finite-Horizon Constraints
In this paper, we study a sequential decision making problem. The objective is to maximize the average reward accumulated over time subject to temporal cost constraints. The novel...
Branislav Kveton, Jia Yuan Yu, Georgios Theocharou...