101 search results - page 17 / 21 » On completely nonmeasurable unions |
DBPL
1997
Springer
13 years 11 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
WG
2010
Springer
13 years 6 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
BMCBI
2008
13 years 7 months ago
2008
Background: Applications of computational methods for predicting protein functional linkages are increasing. In recent years, several bacteria-specific methods for predicting link...
BMCBI
2006
13 years 7 months ago
2006
Background: Despite the current availability of several hundreds of thousands of amino acid sequences, more than 36% of the enzyme activities (EC numbers) defined by the Nomenclat...