458 search results - page 82 / 92 » Distance graphs: from random geometric graphs to Bernoulli g... |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
ICASSP
2011
IEEE
13 years 9 days ago
2011
IEEE
This paper presents a graph-based approach for spoken term detection. Each first-pass retrieved utterance is a node on a graph and the edge between two nodes is weighted by the s...
APPROX
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
CVIU
2008
13 years 8 months ago
2008
This paper presents a novel framework for matching video sequences using the spatiotemporal segmentation of videos. Instead of using appearance features for region correspondence ...
BMCBI
2006
13 years 8 months ago
2006
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...