Sciweavers

999 search results - page 86 / 200
» On the Decidability of Functional Uncertainty
Sort
View
ICALP
2007
Springer
14 years 4 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman
SAMOS
2007
Springer
14 years 4 months ago
A Side-channel Attack Resistant Programmable PKC Coprocessor for Embedded Applications
—This paper describes the design of a programmable coprocessor for Public Key Cryptography (PKC) on an FPGA. The implementation provides a very broad range of functions together ...
Nele Mentens, Kazuo Sakiyama, Lejla Batina, Bart P...
ICMB
2005
IEEE
136views Business» more  ICMB 2005»
14 years 3 months ago
Mobile Recommendation Systems for Decision Making "On the Go"
This paper discusses the functional and technological opportunities associated with mobile recommendation systems. These are systems that help a mobile user or a group of mobile u...
Hans van der Heijden, Gabriele Kotsis, Reinhard Kr...
ICSOC
2005
Springer
14 years 3 months ago
Using Test Cases as Contract to Ensure Service Compliance Across Releases
Web Services are entailing a major shift of perspective in software engineering: software is used and not owned, and operation happens on machines that are out of the user control....
Marcello Bruno, Gerardo Canfora, Massimiliano Di P...
DATE
1998
IEEE
73views Hardware» more  DATE 1998»
14 years 2 months ago
On Removing Multiple Redundancies in Combinational Circuits
1 Redundancy removal is an important step in combinational logic optimization. After a redundant wire is removed, other originally redundant wires may become irredundant, and some ...
David Ihsin Cheng