2635 search results - page 91 / 527 » Computing multihomogeneous resultants using straight-line pr... |
187
click to vote
CPM
1998
Springer
15 years 8 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
129
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper evaluates the performance of a novel View-Oriented Parallel Programming style for parallel programming on cluster computers. View-Oriented Parallel Programming is based...
106
click to vote
IPCO
2004
15 years 5 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
125
Voted
AMAI
2008
Springer
15 years 4 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...