Sciweavers

1100 search results - page 52 / 220
» Approximate distance oracles
Sort
View
AAAI
2010
14 years 11 months ago
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
Ioannis Caragiannis, Dimitris Kalaitzis, Evangelos...
DCG
2010
289views more  DCG 2010»
14 years 10 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
NAA
2004
Springer
152views Mathematics» more  NAA 2004»
15 years 3 months ago
Volterra Series and Numerical Approximations of ODEs
A numerical approach for solving systems of nonautonomous ordinary differential equations (ODEs) is proposed under suitable assumptions. This approach is based on expansion of the...
Nikolay Kirov, Mikhail Krastanov
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 10 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 9 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...