Sciweavers

846 search results - page 64 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
MP
2006
119views more  MP 2006»
13 years 7 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
ICDE
2009
IEEE
135views Database» more  ICDE 2009»
14 years 9 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
ICDE
2006
IEEE
266views Database» more  ICDE 2006»
14 years 9 months ago
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
Ira Assent, Andrea Wenning, Thomas Seidl
POPL
2007
ACM
14 years 8 months ago
Locality approximation using time
Reuse distance (i.e. LRU stack distance) precisely characterizes program locality and has been a basic tool for memory system research since the 1970s. However, the high cost of m...
Xipeng Shen, Jonathan Shaw, Brian Meeker, Chen Din...
EMSOFT
2004
Springer
14 years 1 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross