Sciweavers

1483 search results - page 164 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 2 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
SIGPRO
2008
107views more  SIGPRO 2008»
15 years 1 months ago
Exploiting geometry for improved hybrid AOA/TDOA-based localization
In this paper we examine the geometrically constrained optimization approach to localization with hybrid bearing (angle of arrival, AOA) and time difference of arrival (TDOA) sens...
Adrian N. Bishop, Baris Fidan, Kutluyil Dogancay, ...
CORR
2011
Springer
261views Education» more  CORR 2011»
14 years 8 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
ICPR
2000
IEEE
16 years 2 months ago
Reduction of Bias in Maximum Likelihood Ellipse Fitting
An improved maximum likelihood estimator for ellipse fitting based on the heteroscedastic errors-in-variables (HEIV) regression algorithm is proposed. The technique significantly ...
Bogdan Matei, Peter Meer
ICML
2006
IEEE
16 years 2 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman