Sciweavers

2304 search results - page 161 / 461
» On the Vulnerability of Large Graphs
Sort
View
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
16 years 1 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
16 years 3 days ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
GD
2005
Springer
16 years 1 days ago
GEOMI: GEOmetry for Maximum Insight
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...
Adel Ahmed, Tim Dwyer, Michael Forster, Xiaoyan Fu...
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 10 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
EON
2007
15 years 8 months ago
Benchmarking Reasoners for Multi-Ontology Applications
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Ameet Chitnis, Abir Qasem, Jeff Heflin