Sciweavers

6315 search results - page 172 / 1263
» Approximating Solution Structure
Sort
View
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
16 years 6 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
DCG
2010
289views more  DCG 2010»
15 years 6 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...
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
16 years 8 months ago
Space-Constrained Gram-Based Indexing for Efficient Approximate String Search
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
Alexander Behm, Shengyue Ji, Chen Li, Jiaheng Lu
SIAMMAX
2010
116views more  SIAMMAX 2010»
15 years 1 months ago
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares
Abstract. Linear inverse problems with uncertain measurement matrices appear in many different applications. One of the standard techniques for solving such problems is the total l...
Amir Beck, Yonina C. Eldar
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
16 years 1 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu