Sciweavers

2430 search results - page 457 / 486
» Computing Tutte Polynomials
Sort
View
JOC
2006
69views more  JOC 2006»
13 years 7 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
TOG
2008
92views more  TOG 2008»
13 years 7 months ago
Optimizing cubature for efficient integration of subspace deformations
We propose an efficient scheme for evaluating nonlinear subspace forces (and Jacobians) associated with subspace deformations. The core problem we address is efficient integration...
Steven S. An, Theodore Kim, Doug L. James
TWC
2008
140views more  TWC 2008»
13 years 7 months ago
Exclusive-Region Based Scheduling Algorithms for UWB WPAN
With the capability of supporting very high data rate services in a short range, Ultra-Wideband (UWB) technology is appealing to multimedia applications in future wireless personal...
Kuang-Hao Liu, Lin Cai, Xuemin Shen
CORR
1999
Springer
93views Education» more  CORR 1999»
13 years 7 months ago
On the Power of Positive Turing Reductions
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
Edith Hemaspaandra
TNN
1998
254views more  TNN 1998»
13 years 7 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis