Sciweavers

1282 search results - page 29 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
MOBIHOC
2000
ACM
14 years 1 days ago
Role-based multicast in highly mobile but sparsely connected ad hoc networks
— We present an approach to multicasting messages among highly mobile hosts in ad hoc networks. We suggest a new definition of a role-based multicast that suits the special need...
Linda Briesemeister, Günter Hommel
LREC
2010
213views Education» more  LREC 2010»
13 years 9 months ago
Integrating a Large Domain Ontology of Species into WordNet
With the proliferation of applications sharing information represented in multiple ontologies, the development of automatic methods for robust and accurate ontology matching will ...
Montse Cuadros, Egoitz Laparra, German Rigau, Piek...
ICCV
2011
IEEE
12 years 7 months ago
Dense Disparity Maps from Sparse Disparity Measurements
In this work we propose a method for estimating disparity maps from very few measurements. Based on the theory of Compressive Sensing, our algorithm accurately reconstructs dispar...
Simon Hawe, Martin Kleinsteuber, Klaus Diepold
ICS
2010
Tsinghua U.
14 years 5 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
JMLR
2010
113views more  JMLR 2010»
13 years 2 months ago
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
Kaname Kojima, Eric Perrier, Seiya Imoto, Satoru M...