Sciweavers

3096 search results - page 26 / 620
» The Generalized FITC Approximation
Sort
View
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 11 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
IJFCS
2002
58views more  IJFCS 2002»
13 years 8 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
ORL
2006
114views more  ORL 2006»
13 years 8 months ago
A (1-1/e)-approximation algorithm for the generalized assignment problem
We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
Zeev Nutov, Israel Beniaminy, Raphael Yuster
AAIM
2007
Springer
116views Algorithms» more  AAIM 2007»
14 years 2 months ago
Solving Generalized Maximum Dispersion with Linear Programming
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
Gerold Jäger, Anand Srivastav, Katja Wolf
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
13 years 10 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...