Sciweavers

3874 search results - page 476 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 9 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 5 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 5 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
STOC
1997
ACM
126views Algorithms» more  STOC 1997»
15 years 9 months ago
Page Replacement with Multi-Size Pages and Applications to Web Caching
We consider the paging problem where the pages have varying size. This problem has applications to page replacement policies for caches containing World Wide Web documents. We con...
Sandy Irani
157
Voted
ICCV
2003
IEEE
16 years 7 months ago
Tracking Articulated Body by Dynamic Markov Network
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...
Ying Wu, Gang Hua, Ting Yu