Sciweavers

5615 search results - page 174 / 1123
» On the Computational Capabilities of Several Models
Sort
View
163
Voted
CSL
2010
Springer
15 years 7 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
13 years 8 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
INFOCOM
2008
IEEE
16 years 20 days ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
CODES
2006
IEEE
16 years 10 days ago
Generic netlist representation for system and PE level design exploration
Designer productivity and design predictability are vital factors for successful embedded system design. Shrinking time-to-market and increasing complexity of these systems requir...
Bita Gorjiara, Mehrdad Reshadi, Pramod Chandraiah,...
NORDICHI
2004
ACM
15 years 11 months ago
Facilitating user interface adaptation to mobile devices
One vision of a context-aware pervasive networking environment promises the user a seamless access to surrounding services using her personal mobile device. This requires that the...
Pertti Repo