338 search results - page 66 / 68 » Using pattern matching for tiling and packing problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
PR
2007
13 years 6 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
BMCBI
2005
13 years 7 months ago
2005
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
TON
2002
13 years 7 months ago
2002
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...