4934 search results - page 73 / 987 » complexity 2008 |
108
Voted
CPC
2002
15 years 3 months ago
2002
We study a model motivated by the minesweeper game. In this model one starts with percolation of mines on the sites of the lattice Zd , and then tries to find an infinite path of ...
141
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
127
click to vote
DAM
1999
15 years 3 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
132
click to vote
SIAMSC
2008
15 years 2 months ago
2008
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
123
click to vote
CCCG
2008
15 years 5 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...