Sciweavers

520 search results - page 2 / 104
» Reductions Between Expansion Problems
Sort
View
DCC
2008
IEEE
14 years 4 months ago
Dimension Reduction and Expansion: Distributed Source Coding in a Noisy Environment
We studied the problem of distributed coding and transmission of intercorrelated sources with memory. Different from the conventional distributed source coding structure which rel...
Anna N. Kim, Fredrik Hekland
EUROCRYPT
2006
Springer
13 years 9 months ago
Optimal Reductions Between Oblivious Transfers Using Interactive Hashing
Abstract. We present an asymptotically optimal reduction of one-outof-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunctio...
Claude Crépeau, George Savvides
DATE
2002
IEEE
87views Hardware» more  DATE 2002»
13 years 10 months ago
Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
Yiran Chen, Venkataramanan Balakrishnan, Cheng-Kok...
ENGL
2007
82views more  ENGL 2007»
13 years 5 months ago
Reduct Generation in Information Systems
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
G. Ganesan, D. Latha, C. Raghavendra Rao
KAIS
2000
86views more  KAIS 2000»
13 years 5 months ago
A Mathematical Foundation for Improved Reduct Generation in Information Systems
When data sets are analyzed, statistical pattern recognition is often used to find the information hidden in the data. Another approach to information discovery is data mining. Dat...
Janusz A. Starzyk, Dale E. Nelson, Kirk Sturtz