Sciweavers

941 search results - page 4 / 189
» Efficient Testing of Large Graphs
Sort
View
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 16 days ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
ISQED
2007
IEEE
120views Hardware» more  ISQED 2007»
15 years 5 months ago
A Test-Structure to Efficiently Study Threshold-Voltage Variation in Large MOSFET Arrays
Nigel Drego, Anantha Chandrakasan, Duane S. Boning
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 11 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
IJCV
2006
299views more  IJCV 2006»
14 years 11 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
16 years 16 days ago
Efficient Query Processing in Large Traffic Networks
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...