631 search results - page 45 / 127 » Additive Approximation for Edge-Deletion Problems |
ICIP
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper addresses the problem of determining suitable mask values and sizes for the discrete implementation of the Laplacian of Gaussian edge operator. This is achieved by prov...
100
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
JAL
2007
14 years 9 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
SIGMOD
2012
ACM
13 years 5 days ago
2012
ACM
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...