Sciweavers

1871 search results - page 81 / 375
» The Ephemeral Pairing Problem
Sort
View
PODS
2004
ACM
130views Database» more  PODS 2004»
15 years 11 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
STACS
2009
Springer
15 years 6 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
LCN
1998
IEEE
15 years 3 months ago
Effect of Hidden Terminals on the Performance of IEEE 802.11 MAC Protocol
The hidden terminal problem is unique to wireless networks and as of now, there is very limited understanding about it's effects on network performance. Results are presented...
Sumit Khurana, Anurag Kahol, Anura P. Jayasumana
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 2 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ICCAD
1991
IEEE
135views Hardware» more  ICCAD 1991»
15 years 2 months ago
DIATEST: A Fast Diagnostic Test Pattern Generator for Combinational Circuits
This paper presents an efficient algorithm for the generation of diagnostic test patterns which distinguish between two arbitrary single stuck-at faults. The algorithm is able to ...
Torsten Grüning, Udo Mahlstedt, Hartmut Koopm...