Sciweavers

7811 search results - page 226 / 1563
» computer 2004
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 5 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders
PERCOM
2004
ACM
16 years 5 months ago
Towards Scalable P2P Computing for Mobile Ad Hoc Networks
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
Marco Conti, Enrico Gregori, Giovanni Turi
SBCCI
2004
ACM
134views VLSI» more  SBCCI 2004»
15 years 10 months ago
An approach to computer simulation of bonding and package crosstalk in mixed-signal CMOS ICs
This paper presents an approach for simulation of mixed analog-digital CMOS integrated circuits, aiming at estimating crosstalk effects due to current pulses drawn from voltage s...
Gabriella Trucco, Giorgio Boselli, Valentino Liber...
140
Voted
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
152
Voted
SIGIR
2004
ACM
15 years 10 months ago
A logic-based approach for computing service executions plans in peer-to-peer networks
Abstract. Today, peer-to-peer services can comprise a large and growing number of services, e.g. search services or services dealing with heterogeneous schemas in the context of Di...
Henrik Nottelmann, Norbert Fuhr