23 search results - page 4 / 5 » Generalization of matching extensions in graphs (III) |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
CIVR
2007
Springer
13 years 12 months ago
2007
Springer
In the present study, an efficient strategy for retrieving texture images from large texture databases is introduced and studied within a distributional-statistical framework. Our...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
SIGMOD
2007
ACM
14 years 5 months ago
2007
ACM
Many database applications require the analysis and processing of data streams. In such systems, huge amounts of data arrive rapidly and their values change over time. The variati...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...