Sciweavers

Share
JMLR
2010
134views more  JMLR 2010»
9 years 1 months ago
Bayesian Algorithms for Causal Data Mining
We present two Bayesian algorithms CD-B and CD-H for discovering unconfounded cause and effect relationships from observational data without assuming causal sufficiency which prec...
Subramani Mani, Constantin F. Aliferis, Alexander ...
WWW
2011
ACM
9 years 1 months ago
Finding the bias and prestige of nodes in networks based on trust scores
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
Abhinav Mishra, Arnab Bhattacharya
DAC
2010
ACM
9 years 1 months ago
Node addition and removal in the presence of don't cares
This paper presents a logic restructuring technique named node addition and removal (NAR). It works by adding a node into a circuit to replace an existing node and then removing t...
Yung-Chih Chen, Chun-Yao Wang
IJNSEC
2011
77views more  IJNSEC 2011»
9 years 1 months ago
Performance Evaluation of the TSS Node Authentication Scheme in Noisy MANETs
This paper presents a description and performance evaluation of a threshold secret sharing (TSS) node authentication scheme in noisy mobile ad hoc networks (MANETs). The scheme ca...
Hussein Al-Bahadili, Shakir Hussain, Ghassan Issa,...
CORR
2011
Springer
183views Education» more  CORR 2011»
9 years 1 months ago
Detecting Separation in Robotic and Sensor Networks
In this paper we consider the problem of monitoring detecting separation of agents from a base station in robotic and sensor networks. Such separation can be caused by mobility an...
Chenda Liao, Harshavardhan Chenji, Prabir Barooah,...
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
9 years 1 months ago
Distributed constrained optimization over noisy networks
In this paper we deal with two problems which are of great interest in the field of distributed decision making and control. The first problem we tackle is the problem of achieving...
Kunal Srivastava, Angelia Nedic, Dusan M. Stipanov...
ALT
2010
Springer
9 years 1 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
ALGORITHMICA
2011
9 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICC
2009
IEEE
140views Communications» more  ICC 2009»
9 years 4 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
WOA
2010
9 years 4 months ago
A Self-Organising System for Resource Finding in Large-Scale Computational Grids
This paper presents a novel approach for resource finding and job allocation in a computational Grid. The proposed system is called HYGRA, for HYperspace-based Grid Resource Alloca...
Fabrizio Messina, Giuseppe Pappalardo, Corrado San...
books