415 search results - page 46 / 83 » Optimal query complexity bounds for finding graphs |
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
ISBI
2009
IEEE
14 years 2 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...