Sciweavers

2842 search results - page 477 / 569
» Expansion and Search in Networks
Sort
View
ADHOC
2010
317views more  ADHOC 2010»
13 years 7 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão

Publication
181views
13 years 6 months ago
Causality Applicatoin Ontology: A Therory of Definition Derived From Analytical Meditation
Advancing the synthesis of Eastern mind science with Western physical science will require a robust and easy-to-traverse bridge between the atypical apprehensions within meditation...
Samuel R Dismond III
ICASSP
2011
IEEE
13 years 1 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
CIKM
2011
Springer
12 years 10 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 10 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...