Sciweavers

216 search results - page 10 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
11 years 11 months ago
Fast SLCA and ELCA Computation for XML Keyword Queries Based on Set Intersection
— In this paper, we focus on efficient keyword query processing for XML data based on SLCA and ELCA semantics. We propose for each keyword a novel form of inverted list, which i...
Junfeng Zhou, Zhifeng Bao, Wei Wang, Tok Wang Ling...
CVPR
2000
IEEE
14 years 1 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
RTSS
2006
IEEE
14 years 2 months ago
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
We present an optimal real-time scheduling algorithm for multiprocessors — one that satisfies all task deadlines, when the total utilization demand does not exceed the utilizat...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
COR
2008
111views more  COR 2008»
13 years 8 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
DAC
2003
ACM
14 years 9 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li