Sciweavers

3702 search results - page 97 / 741
» Reducing Misclassification Costs
Sort
View
IDEAS
2003
IEEE
171views Database» more  IDEAS 2003»
14 years 2 months ago
Dynamic Data Management for Location Based Services in Mobile Environments
We characterize the dynamic data management problem for location based services(LBS) in mobile environments and devise a cost model for servicing both location independent and loc...
Shiow-yang Wu, Kun-Ta Wu
CCGRID
2002
IEEE
14 years 1 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
ICDCS
2002
IEEE
14 years 1 months ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy
IPPS
1998
IEEE
14 years 1 months ago
Affordable Fault Tolerance Through Adaptation
Fault-tolerant programs are typically not only difficult to implement but also incur extra costs in terms of performance or resource consumption. Failures are typically relatively ...
Ilwoo Chang, Matti A. Hiltunen, Richard D. Schlich...
DAC
1997
ACM
14 years 1 months ago
A Parallel/Serial Trade-Off Methodology for Look-Up Table Based Decoders
A methodology for architecture exploration of look-up table based decoders is presented. For the degree of parallel processing a trade-off can be made by exploring system level an...
Claus Schneider