Sciweavers

1736 search results - page 163 / 348
» The rank-width of Directed Graphs
Sort
View
DAM
2007
100views more  DAM 2007»
15 years 4 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
PPOPP
2010
ACM
16 years 1 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
AAAI
2008
15 years 7 months ago
Query-URL Bipartite Based Approach to Personalized Query Recommendation
Query recommendation is considered an effective assistant in enhancing keyword based queries in search engines and Web search software. Conventional approach to query recommendati...
Lin Li, Zhenglu Yang, Ling Liu, Masaru Kitsuregawa
SIMUTOOLS
2008
15 years 6 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 4 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran