4998 search results - page 860 / 1000 » The case for intentional networking |
160
click to vote
CCS
2004
ACM
15 years 12 months ago
2004
ACM
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
160
click to vote
CDVE
2004
Springer
15 years 12 months ago
2004
Springer
Not all participants in a collaborative virtual environment (CVE) need to be informed of every other participant’s activities. The technique used for filtering irrelevant message...
147
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
174
click to vote
IFIP
2004
Springer
15 years 12 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
173
click to vote
ISMIR
2004
Springer
15 years 12 months ago
2004
Springer
This paper presents a system that extracts 109 musical features from symbolic recordings (MIDI, in this case) and uses them to classify the recordings by genre. The features used ...