Sciweavers

4047 search results - page 126 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
139
Voted
CORR
2010
Springer
221views Education» more  CORR 2010»
15 years 2 months ago
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...
135
Voted
WINE
2007
Springer
171views Economy» more  WINE 2007»
15 years 10 months ago
Characterizing Truthful Market Design
This paper characterizes the family of truthful doublesided auctions. Despite the importance of double-sided auctions to market design, to date no characterization of truthful dou...
Mira Gonen, Rica Gonen, Elan Pavlov
CRYPTO
2000
Springer
141views Cryptology» more  CRYPTO 2000»
15 years 9 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
NETWORKS
2006
15 years 4 months ago
Approximation algorithms for channel allocation problems in broadcast networks
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...
EAAI
2007
154views more  EAAI 2007»
15 years 4 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho