Sciweavers

976 search results - page 166 / 196
» The Complexity of Timetable Construction Problems
Sort
View
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 3 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...
SP
2007
IEEE
108views Security Privacy» more  SP 2007»
14 years 3 months ago
Trojan Detection using IC Fingerprinting
Hardware manufacturers are increasingly outsourcing their IC fabrication work overseas due to much lower costs. This poses a significant security risk for ICs used for critical m...
Dakshi Agrawal, Selçuk Baktir, Deniz Karako...
ALT
2007
Springer
14 years 3 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
APSEC
2006
IEEE
14 years 2 months ago
Genericity - a "Missing in Action" Key to Software Simplification and Reuse
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
Stan Jarzabek
BMCBI
2010
95views more  BMCBI 2010»
13 years 9 months ago
EPSVR and EPMeta: prediction of antigenic epitopes using support vector regression and multiple server results
Background: Accurate prediction of antigenic epitopes is important for immunologic research and medical applications, but it is still an open problem in bioinformatics. The case f...
Shide Liang, Dandan Zheng, Daron M. Standley, Bo Y...