Sciweavers

432 search results - page 35 / 87
» Open Problems with Part-Whole Relations
Sort
View
78
Voted
ICCAD
1998
IEEE
143views Hardware» more  ICCAD 1998»
15 years 4 months ago
Real-time operating systems for embedded computing
We survey the state-of-the-art in real-time operating systems (RTOSs) from the system synthesis point of view. RTOSs have a very long research history which provides important the...
Serge Hustin, Miodrag Potkonjak, Eric Verhulst, Wa...
CIE
2006
Springer
15 years 4 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
94
Voted
CLEIEJ
2008
88views more  CLEIEJ 2008»
15 years 17 days ago
A Trust Model for a Group of E-mail Servers
E-mail services are essential in the Internet. However, the current e-mail architecture presents problems that open it to several threats. Alternatives have been proposed to solve...
Leonardo de Oliveira, Carlos Maziero
92
Voted
IJNSEC
2006
71views more  IJNSEC 2006»
15 years 14 days ago
Fundamental Limits on a Model of Privacy-Trust Tradeoff: Information Theoretic Approach
Zhong et al. formulated the problem of disclosing credentials (associated with privacy) for building trust in an open environment like Internet. Thus, one form of privacy-trust pr...
Rama Murthy Garimella
MP
2006
80views more  MP 2006»
15 years 12 days ago
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
Jiawang Nie, James Demmel, Bernd Sturmfels