Sciweavers

3008 search results - page 285 / 602
» Independence in connected graphs
Sort
View
DSD
2006
IEEE
110views Hardware» more  DSD 2006»
16 years 23 days ago
A Graph Based Algorithm for Data Path Optimization in Custom Processors
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
Jelena Trajkovic, Mehrdad Reshadi, Bita Gorjiara, ...
PAKDD
2010
ACM
117views Data Mining» more  PAKDD 2010»
15 years 11 months ago
BASSET: Scalable Gateway Finder in Large Graphs
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...
Hanghang Tong, Spiros Papadimitriou, Christos Falo...
EKAW
2006
Springer
15 years 10 months ago
Capturing Quantified Constraints in FOL, Through Interaction with a Relationship Graph
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
Peter M. D. Gray, Graham J. L. Kemp
AAAI
2007
15 years 9 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
PODC
2010
ACM
15 years 8 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...