Sciweavers

2031 search results - page 173 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
TIP
2002
116views more  TIP 2002»
13 years 8 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
CEC
2007
IEEE
14 years 2 months ago
The application of evolutionary multi-criteria optimization to dynamic molecular alignment
— This study introduces the multi-criteria approach to the optimization of dynamic molecular alignment by shaped femtosecond laser pulses, which has been considered so far only a...
Ofer M. Shir, Michael Emmerich, Thomas Bäck, ...
EDBT
2011
ACM
231views Database» more  EDBT 2011»
12 years 12 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 10 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...