Sciweavers

449 search results - page 77 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
WWW
2010
ACM
14 years 2 months ago
SourceRank: relevance and trust assessment for deep web sources based on inter-source agreement
We consider the problem of deep web source selection and argue that existing source selection methods are inadequate as they are based on local similarity assessment. Specificall...
Raju Balakrishnan, Subbarao Kambhampati
ISCIS
2005
Springer
14 years 1 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
FOCS
1993
IEEE
13 years 12 months ago
On Bounded Queries and Approximation
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
Richard Chang, William I. Gasarch
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 7 months ago
Topological analysis of the power grid and mitigation strategies against cascading failures
This paper presents a complex systems overview of a power grid network under cascading conditions. The cascading effect has been simulated on three different networks, the IEEE 300...
Sakshi Pahwa, Amelia Hodges, Caterina M. Scoglio, ...
ECCV
2008
Springer
14 years 9 months ago
Cross-View Action Recognition from Temporal Self-similarities
This paper concerns recognition of human actions under view changes. We explore self-similarities of action sequences over time and observe the striking stability of such measures ...
Imran N. Junejo, Emilie Dexter, Ivan Laptev, Patri...