Sciweavers

149 search results - page 10 / 30
» On Finding Minimum Deadly Sets for Directed Networks
Sort
View
NETWORKS
2002
13 years 7 months ago
Approximation algorithms for constructing wavelength routing networks
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
Refael Hassin, Asaf Levin
ICCCN
2008
IEEE
14 years 1 months ago
TRACK: A Novel Connected Dominating Set based Sink Mobility Model for WSNs
—The core functionality of a wireless sensor network (WSN) is to detect deviations in expected normal behavior and report it to the sink. In this paper, we propose TRACK — a no...
Avinash Srinivasan, Jie Wu
ICMLA
2004
13 years 9 months ago
Outlier detection and evaluation by network flow
Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, su...
Ying Liu, Alan P. Sprague
COGSCI
2010
114views more  COGSCI 2010»
13 years 7 months ago
Direct Associations or Internal Transformations? Exploring the Mechanisms Underlying Sequential Learning Behavior
We evaluate two broad classes of cognitive mechanisms that might support the learning of sequential patterns. According to the first, learning is based on the gradual accumulation...
Todd M. Gureckis, Bradley C. Love
BMCBI
2006
114views more  BMCBI 2006»
13 years 7 months ago
A direct comparison of protein interaction confidence assignment schemes
Background: Recent technological advances have enabled high-throughput measurements of protein-protein interactions in the cell, producing large protein interaction networks for v...
Silpa Suthram, Tomer Shlomi, Eytan Ruppin, Roded S...