Sciweavers

13603 search results - page 69 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
DCC
1993
IEEE
15 years 10 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
131
Voted
BMCBI
2008
125views more  BMCBI 2008»
15 years 6 months ago
Competition between protein aggregation and protein complex formation
ent> <title> <p>Highlights from the Fourth International Society for Computational Biology (ISCB) Student Council Symposium</p> </title> <editor>Lu...
Sebastian Pechmann, Emmanuel D. Levy, Gian G. Tart...
CC
2007
Springer
108views System Software» more  CC 2007»
15 years 5 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
ISW
2010
Springer
15 years 3 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
ATAL
2008
Springer
15 years 7 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh