Sciweavers

280 search results - page 40 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
WIOPT
2011
IEEE
14 years 3 months ago
LIFO-Backpressure achieves near optimal utility-delay tradeoff
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open probl...
Longbo Huang, Scott Moeller, Michael J. Neely, Bha...
ISNN
2005
Springer
15 years 5 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
CIKM
2010
Springer
14 years 10 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
CCE
2008
14 years 12 months ago
Bidirectional branch and bound for controlled variable selection: Part I. Principles and minimum singular value criterion
The minimum singular value (MSV) rule is a useful tool for selecting controlled variables (CVs) from the available measurements. However, the application of the MSV rule to large-...
Yi Cao, Vinay Kariwala
IVC
2007
188views more  IVC 2007»
14 years 11 months ago
Integration of deformable contours and a multiple hypotheses Fisher color model for robust tracking in varying illuminant enviro
In this paper, we propose a new technique to perform figure-ground segmentation in image sequences of moving objects under varying illumination conditions. Unlike most of the alg...
Francesc Moreno-Noguer, Alberto Sanfeliu, Dimitris...