1743 search results - page 174 / 349 » Generalized Modal Satisfiability |
170
click to vote
COLING
2010
15 years 1 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
168
click to vote
SIAMDM
2011
15 years 1 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
154
click to vote
TVCG
2011
15 years 1 months ago
2011
—In this paper, we propose a method designed to allow creatures to actively respond to a fluid environment. We explore various objective functions in order to determine ways to ...
154
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
We consider the Saint-Venant system for shallow water flows with non-flat bottom. In the past years, efficient well-balanced methods have been proposed in order to well resolve sol...
220
click to vote
TIT
2010
15 years 1 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...