Sciweavers

44 search results - page 7 / 9
» From PIMs to PSMs
Sort
View
CSR
2009
Springer
15 years 4 months ago
Partitioning Graphs into Connected Parts
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
Pim van 't Hof, Daniël Paulusma, Gerhard J. W...
HICSS
1999
IEEE
111views Biometrics» more  HICSS 1999»
15 years 1 months ago
T Spaces: The Next Wave
Millions of small heterogeneous computers are poised to spread into the infrastructure of our society. Though mostly inconspicuous today, disguised as nothing more than PIM (perso...
Tobin J. Lehman, Stephen W. McLaughry, Peter Wycko...
CTRSA
2006
Springer
160views Cryptology» more  CTRSA 2006»
15 years 1 months ago
RFID-Tags for Anti-counterfeiting
RFID-tags are becoming very popular tools for identification of products. As they have a small microchip on board, they offer functionality that can be used for security purposes. ...
Pim Tuyls, Lejla Batina
ICSOFT
2007
14 years 11 months ago
Integrating Software Architecture Concepts Into the MDA Platform
: Architecture Description Languages (ADLs) provide an abstract representation of software systems. Achieving a concrete mapping of such representation into the implementation is o...
Adel Alti, Tahar Khammaci, Adel Smeda, Djamel Benn...
IPL
2008
80views more  IPL 2008»
14 years 9 months ago
Path partitions of hypercubes
A path partition of a graph G is a set of vertex-disjoint paths that cover all vertices of G. Given a set P = {{ai, bi}}m i=1 of pairs of distinct vertices of the n-dimensional hy...
Petr Gregor, Tomás Dvorák