Sciweavers

6251 search results - page 1119 / 1251
» Randomness, Computability, and Density
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Optimum multi-user detection by nonsmooth optimization
—The optimum multiuser detection (OMD) is a discrete (binary) optimization. The previously developed approaches often relax it by a semi-definite program (SDP) and then employ r...
Hoang Duong Tuan, Tran Thai Son, Hoang Tuy, Ha H. ...
ICALP
2011
Springer
14 years 10 months ago
Clustering with Local Restrictions
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
Daniel Lokshtanov, Dániel Marx
HISB
2011
92views more  HISB 2011»
14 years 6 months ago
Unsupervised Grow-Cut: Cellular Automata-Based Medical Image Segmentation
— This paper presents a new cellular automata-based unsupervised image segmentation technique that is motivated by the interactive grow-cut algorithm. In contrast to the traditio...
Payel Ghosh, Sameer Antani, L. Rodney Long, George...
COMSNETS
2012
163views more  COMSNETS 2012»
14 years 2 months ago
Steptacular: An incentive mechanism for promoting wellness
Abstract—This paper describes Steptacular, an online interactive incentive system for encouraging people to walk more. A trial offering Steptacular to the employees of Accenture-...
Naini Gomes, Deepak Merugu, Gearoid O'Brien, Chinm...
JMLR
2012
13 years 9 months ago
Age-Layered Expectation Maximization for Parameter Learning in Bayesian Networks
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Avneesh Singh Saluja, Priya Krishnan Sundararajan,...
« Prev « First page 1119 / 1251 Last » Next »