1215 search results - page 182 / 243 » Combinatorics |
476
click to vote
CPM
2011
Springer
14 years 9 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
415
click to vote
COCOON
2011
Springer
14 years 5 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
148
click to vote
FSTTCS
2009
Springer
16 years 15 days ago
2009
Springer
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...
105
click to vote
COCOON
2007
Springer
16 years 3 days ago
2007
Springer
Tandem repeated regions are closely related to some genetic diseases in human beings. Once a region containing pseudo-periodic repeats is found, it is interesting to study the his...
119
click to vote
CPM
2007
Springer
16 years 3 days ago
2007
Springer
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...