1503 search results - page 164 / 301 » Detecting Anomalies in Graphs |
148
click to vote
ESA
2005
Springer
16 years 21 hour ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...
128
click to vote
WEBI
2005
Springer
15 years 12 months ago
2005
Springer
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
208
click to vote
DASFAA
2007
IEEE
16 years 25 days ago
2007
IEEE
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
175
click to vote
PRDC
2006
IEEE
16 years 15 days ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...
165
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...