941 search results - page 52 / 189 » Efficient Testing of Large Graphs |
IS
2007
14 years 9 months ago
2007
Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purp...
CAD
2000
Springer
14 years 9 months ago
2000
Springer
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
TSMC
2002
14 years 9 months ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
STACS
2007
Springer
15 years 3 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...
102
click to vote
FQAS
2004
Springer
15 years 1 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...