Sciweavers

9611 search results - page 193 / 1923
» A Note on Difference Sets
Sort
View
MADNES
2005
Springer
15 years 11 months ago
Panel: Authentication in Constrained Environments
Abstract. This paper contains the summary of a panel on authentication in constrained environments held during the Secure MADNES’05 Workshop. These were transcribed from hand-wri...
Mike Burmester, Virgil D. Gligor, Evangelos Kranak...
206
Voted
SWAT
2010
Springer
302views Algorithms» more  SWAT 2010»
15 years 11 months ago
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
Imran A. Pirwani, Mohammad R. Salavatipour
HICSS
2002
IEEE
136views Biometrics» more  HICSS 2002»
15 years 11 months ago
The Value Relevance of Information Technology Investment Announcements: Incorporating Industry Strategic IT Role
: This research note both confirms and extends the value relevance of information technology announcements found by Im et al (2001) and Dos Santos et al. (1993). We extend their wo...
Vernon J. Richardson, Robert W. Zmud
JCISE
2002
166views more  JCISE 2002»
15 years 5 months ago
The STEP Modular Architecture
The first Technical Note in this series [1] introduced the international standard ISO 10303, informally known as STEP (STandard for the Exchange of Product model data). Subsequent...
Allison Barnard Feeney
182
Voted
JCT
2010
79views more  JCT 2010»
15 years 4 months ago
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
Maciej Kalkowski, Michal Karonski, Florian Pfender