3702 search results - page 173 / 741 » All Pairings Are in a Group |
200
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
229
click to vote
ECCC
2007
15 years 6 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
196
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Measuring the similarity between semantic relations that hold among entities is an important and necessary step in various Web related tasks such as relation extraction, informati...
189
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
213
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...