Sciweavers

7913 search results - page 461 / 1583
» Information Collection on a Graph
Sort
View
154
Voted
IS
2007
15 years 4 months ago
Discovering frequent geometric subgraphs
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
Michihiro Kuramochi, George Karypis
CODES
2010
IEEE
15 years 3 months ago
Worst-case performance analysis of synchronous dataflow scenarios
Synchronous Dataflow (SDF) is a powerful analysis tool for regular, cyclic, parallel task graphs. The behaviour of SDF graphs however is static and therefore not always able to ac...
Marc Geilen, Sander Stuijk
DAM
2011
14 years 12 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
CHI
2005
ACM
16 years 5 months ago
Evaluating navigational surrogate formats with divergent browsing tasks
Navigational surrogates are representations that stand for information resources within search engine result sets, e-commerce sites, and digital libraries. They also form the basi...
Andruid Kerne, Steven M. Smith, Hyun Choi, Ross Gr...
CIKM
2011
Springer
14 years 5 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...
Mo Zhou, Yifan Pan, Yuqing Wu