Sciweavers

8060 search results - page 1268 / 1612
» Adaptive BICM-OFDM Systems
Sort
View
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
Ivan Damgård, Jesper Buus Nielsen
HT
1999
ACM
15 years 11 months ago
Mix'n'match: Exchangeable Modules of Hypermedia Style
Making hypermedia adaptable for multiple forms of presentation involves enabling multiple distinct specifications for how a given collection of hypermedia can have its presentatio...
Lloyd Rutledge, Lynda Hardman, Jacco van Ossenbrug...
SIGIR
1999
ACM
15 years 11 months ago
Summarizing Text Documents: Sentence Selection and Evaluation Metrics
Human-quality text summarization systems are di cult to design, and even more di cult to evaluate, in part because documents can di er along several dimensions, such as length, wri...
Jade Goldstein, Mark Kantrowitz, Vibhu O. Mittal, ...
ICNP
1999
IEEE
15 years 11 months ago
Scaling End-to-End Multicast Transports with a Topologically-Sensitive Group Formation Protocol
While the IP unicast service has proven successful, extending end-to-end adaptation to multicast has been a difficult problem. Unlike the unicast case, multicast protocols must su...
Sylvia Ratnasamy, Steven McCanne
ICPP
1999
IEEE
15 years 11 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
« Prev « First page 1268 / 1612 Last » Next »