Sciweavers

1709 search results - page 254 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
ICFP
1997
ACM
15 years 8 months ago
The Effectiveness of Flow Analysis for Inlining
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
J. Michael Ashley
122
Voted
JSW
2007
96views more  JSW 2007»
15 years 4 months ago
Dynamic Scheduling of Skippable Periodic Tasks: Issues and Proposals
Abstract— This paper deals with dynamic scheduling in realtime systems that have Quality of Service requirements. We assume that tasks are periodic and may miss their deadlines, ...
Maryline Silly-Chetto, Audrey Marchand
TASLP
2008
122views more  TASLP 2008»
15 years 3 months ago
Challenging Uncertainty in Query by Humming Systems: A Fingerprinting Approach
Robust data retrieval in the presence of uncertainty is a challenging problem in multimedia information retrieval. In query-by-humming (QBH) systems, uncertainty can arise in query...
Erdem Unal, Elaine Chew, Panayiotis G. Georgiou, S...
ACNS
2007
Springer
165views Cryptology» more  ACNS 2007»
15 years 11 months ago
Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
We present two transforms to acquire chosen ciphertext security from tag based techniques. The first one requires the separability of underlying primitives. By separability, info...
Rui Zhang 0002
140
Voted
ICOIN
2004
Springer
15 years 10 months ago
On Reducing Paging Cost in IP-Based Wireless/Mobile Networks
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...
Kyoungae Kim, Sangheon Pack, Yanghee Choi