587 search results - page 91 / 118 » Theory of matching pursuit |
UIST
1999
ACM
14 years 22 days ago
1999
ACM
We present experimental work which explores how the match (or mismatch) between the input space of the hands and the output space of a graphical display influences twohanded input...
ICCAD
1999
IEEE
14 years 22 days ago
1999
IEEE
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
ACMSE
1990
ACM
14 years 15 days ago
1990
ACM
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
PODC
2010
ACM
14 years 10 days ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
PODC
2010
ACM
14 years 10 days ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...