13987 search results - page 777 / 2798 » The Two Guards Problem |
206
click to vote
COGSCI
2010
15 years 7 months ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
196
click to vote
CE
2008
15 years 7 months ago
2008
Design patterns have become a widely acknowledged software engineering practice and therefore have been incorporated in the curricula of most computer science departments. This pa...
222
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
208
click to vote
ALGORITHMICA
2006
15 years 7 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
225
click to vote
ENDM
2008
15 years 7 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...