Sciweavers

2576 search results - page 272 / 516
» The Complexity of Zero Knowledge
Sort
View
KES
2004
Springer
16 years 13 hour ago
Multi-agent Web Recommendation Method Based on Indirect Association Rules
Recommendation systems often use association rules as main technique to discover useful links among the set of transactions, especially web usage data – historical user sessions....
Przemyslaw Kazienko
164
Voted
POLICY
2004
Springer
16 years 6 hour ago
PROTON: A Policy-based Solution for Future 4G devices
We present PROTON, a policy-based solution for 4G mobile devices – it allows users to seamlessly connect to highly integrated heterogeneous wireless networks. The key motivation...
Pablo Vidales, Rajiv Chakravorty, Calicrates Polic...
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
15 years 12 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee
HICSS
2003
IEEE
125views Biometrics» more  HICSS 2003»
15 years 12 months ago
Verifying Trustworthiness Requirements in Distributed Systems with Formal Log-file Analysis
The paper reports on an analysis technology based on the tracing approach to test trustworthy requirements of a distributed system. The system under test is instrumented such that...
Andreas Ulrich, Hesham Hallal, Alexandre Petrenko,...
ICDAR
2003
IEEE
15 years 12 months ago
Postal Envelope Segmentation by 2-D Histogram Clustering through Watershed Transform
In this paper we present a new postal envelope segmentation method based on 2-D histogram clustering and watershed transform. Segmentation task consists in detecting the modes ass...
Eduardo Akira Yonekura, Jacques Facon