Sciweavers

587 search results - page 117 / 118
» Theory of matching pursuit
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 3 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
AUGHUMAN
2010
13 years 3 months ago
Aided eyes: eye activity sensing for daily life
Our eyes collect a considerable amount of information when we use them to look at objects. In particular, eye movement allows us to gaze at an object and shows our level of intere...
Yoshio Ishiguro, Adiyan Mujibiya, Takashi Miyaki, ...
DAM
2011
13 years 11 days ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
PODS
2011
ACM
238views Database» more  PODS 2011»
12 years 8 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
SIGIR
2011
ACM
12 years 8 months ago
Utilizing marginal net utility for recommendation in e-commerce
Traditional recommendation algorithms often select products with the highest predicted ratings to recommend. However, earlier research in economics and marketing indicates that a ...
Jian Wang, Yi Zhang