Sciweavers

1282 search results - page 92 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
IEEEARES
2010
IEEE
15 years 8 months ago
Optimising IDS Sensor Placement
—In large network environments multiple intrusion detection sensors are needed to adequately monitor network traffic. However, deploying and managing additional sensors on a lar...
Hao Chen, John A. Clark, Siraj A. Shaikh, Howard C...
IWANN
2001
Springer
15 years 9 months ago
The Minimum Entropy and Cumulants Based Contrast Functions for Blind Source Extraction
Abstract. In this paper we address the problem of blind source extraction of a subset of “interesting” independent sources from a linear convolutive or instantaneous mixture. T...
Sergio Cruces, Andrzej Cichocki, Shun-ichi Amari
CORR
2010
Springer
255views Education» more  CORR 2010»
15 years 4 months ago
Scalable Tensor Factorizations for Incomplete Data
The problem of incomplete data--i.e., data with missing or unknown values--in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometri...
Evrim Acar, Tamara G. Kolda, Daniel M. Dunlavy, Mo...
IPPS
2008
IEEE
15 years 11 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 8 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...