Sciweavers

1389 search results - page 97 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 3 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
112
Voted
NIPS
2007
15 years 4 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
IPPS
2006
IEEE
15 years 9 months ago
Battery-aware router scheduling in wireless mesh networks
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
Chi Ma, Zhenghao Zhang, Yuanyuan Yang
CVPR
2003
IEEE
16 years 5 months ago
Learning Bayesian Network Classifiers for Facial Expression Recognition using both Labeled and Unlabeled Data
Understanding human emotions is one of the necessary skills for the computer to interact intelligently with human users. The most expressive way humans display emotions is through...
Ira Cohen, Nicu Sebe, Fabio Gagliardi Cozman, Marc...
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 3 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula