Sciweavers

4103 search results - page 226 / 821
» Some results on the Collatz problem
Sort
View
DAWAK
2003
Springer
15 years 12 months ago
Using an Interest Ontology for Improved Support in Rule Mining
Abstract. This paper describes the use of a concept hierarchy for improving the results of association rule mining. Given a large set of tuples with demographic information and per...
Xiaoming Chen, Xuan Zhou, Richard B. Scherl, James...
ENC
2004
IEEE
15 years 10 months ago
A New Cache Approach Based on Graph for Web Servers
This article deals with the problem of data cache for dynamic web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is...
Euloge Edi, Denis Trystram, Jean-Marc Vincent
AAAI
1998
15 years 8 months ago
"Squeaky Wheel" Optimization
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
David Joslin, David P. Clements
ASIACRYPT
2007
Springer
16 years 28 days ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
CORR
2011
Springer
159views Education» more  CORR 2011»
15 years 1 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...