Sciweavers

1091 search results - page 51 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
VLDB
1999
ACM
145views Database» more  VLDB 1999»
14 years 14 hour ago
DBMSs on a Modern Processor: Where Does Time Go?
Recent high-performance processors employ sophisticated techniques to overlap and simultaneously execute multiple computation and memory operations. Intuitively, these techniques ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
14 years 9 months ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...
IPPS
2002
IEEE
14 years 21 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
ICML
2005
IEEE
14 years 8 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
CVPR
1998
IEEE
14 years 9 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih