725 search results - page 90 / 145 » A General Greedy Approximation Algorithm with Applications |
AOSD
2007
ACM
15 years 1 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
VMV
2007
14 years 11 months ago
2007
Whenever approximate 3D geometry is projectively texture-mapped from different directions simultaneously, annoyingly visible aliasing artifacts are the result. To prevent such gho...
SIGECOM
2005
ACM
15 years 3 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...