633 search results - page 79 / 127 » A Classified and Comparative Study of Edge Detection Algorit... |
163
click to vote
EDBT
2012
ACM
13 years 7 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
243
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
134
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
138
Voted
CORR
2007
Springer
15 years 4 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...
180
click to vote
MOBICOM
2010
ACM
15 years 5 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...