Sciweavers

1015 search results - page 23 / 203
» An efficient algorithm for AS path inferring
Sort
View
APPT
2007
Springer
14 years 2 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
DILS
2004
Springer
13 years 11 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
DSN
2011
IEEE
12 years 7 months ago
Cross-layer resilience using wearout aware design flow
—As process technology shrinks devices, circuits experience accelerated wearout. Monitoring wearout will be critical for improving the efficiency of error detection and correctio...
Bardia Zandian, Murali Annavaram
JMLR
2010
137views more  JMLR 2010»
13 years 2 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel