Sciweavers

455 search results - page 56 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
DC
2010
15 years 1 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 1 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
INFOCOM
2010
IEEE
14 years 10 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...
COLING
2008
15 years 2 months ago
Homotopy-Based Semi-Supervised Hidden Markov Models for Sequence Labeling
This paper explores the use of the homotopy method for training a semi-supervised Hidden Markov Model (HMM) used for sequence labeling. We provide a novel polynomial-time algorith...
Gholamreza Haffari, Anoop Sarkar
PAKDD
2011
ACM
253views Data Mining» more  PAKDD 2011»
14 years 4 months ago
Balance Support Vector Machines Locally Using the Structural Similarity Kernel
A structural similarity kernel is presented in this paper for SVM learning, especially for learning with imbalanced datasets. Kernels in SVM are usually pairwise, comparing the sim...
Jianxin Wu