Sciweavers

3913 search results - page 132 / 783
» complexity 2006
Sort
View
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
14 years 2 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
IJCNN
2006
IEEE
14 years 4 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
IJHPCA
2006
75views more  IJHPCA 2006»
13 years 10 months ago
Scheduling Multiple Divisible Loads
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
Maciej Drozdowski, Marcin Lawenda, Fréd&eac...
JOT
2010
96views more  JOT 2010»
13 years 8 months ago
UML Profiles for Modeling Real-Time Communication Protocols
Validation of non-functional and functional properties of these protocols during the early stages of design and development is important to reduce cost resulting from protocol ano...
Barath Kumar, Jürgen Jasperneite
DISOPT
2007
93views more  DISOPT 2007»
13 years 10 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...