2321 search results - page 209 / 465 » Optimizing WebPage Interest |
181
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
163
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper, we present a novel approach for automatically learning a compact and yet discriminative appearance-based human action model. A video sequence is represented by a ba...
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Recently there has been much interest in using transmit beamforming to provide multi-antenna physical-layer multicasting. A state of the art in this context is the semidefinite r...
161
click to vote
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
137
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...