4865 search results - page 374 / 973 » The Complexity of Graph Connectivity |
138
click to vote
PAKDD
2010
ACM
15 years 11 months ago
2010
ACM
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...
175
click to vote
EKAW
2006
Springer
15 years 10 months ago
2006
Springer
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...
163
click to vote
AAAI
2007
15 years 9 months ago
2007
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...
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Given a Poisson process on a d-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are give...
172
click to vote
MOC
2011
15 years 1 months ago
2011
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...