Sciweavers

26354 search results - page 341 / 5271
» How we refactor, and how we know it
Sort
View
176
Voted
GBRPR
2005
Springer
16 years 8 days ago
Towards Unitary Representations for Graph Matching
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
David Emms, Simone Severini, Richard C. Wilson, Ed...
IH
2001
Springer
15 years 11 months ago
The Strong Eternity Service
Strong Eternity Service is a safe and very reliable storage for data of high importance. We show how to establish persistent pseudonyms in a totally anonymous environment and how t...
Tonda Benes
INFOCOM
2000
IEEE
15 years 11 months ago
On the Aggregatability of Multicast Forwarding State
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
David Thaler, Mark Handley
HICSS
1998
IEEE
139views Biometrics» more  HICSS 1998»
15 years 11 months ago
Annotation and Segmentation for Multimedia Indexing and Retrieval
In this paper we describe a method for indexing and retrieval of multimedia data based on annotation and segmentation. Our goal is the retrieval of segments of audio and video sui...
Lynn Wilcox, John S. Boreczky
ISCA
1990
IEEE
68views Hardware» more  ISCA 1990»
15 years 11 months ago
Maximizing Performance in a Striped Disk Array
Improvements in disk speeds have not kept up with improvements in processor and memory speeds. One way to correct the resulting speed mismatch is to stripe data across many disks. ...
Peter M. Chen, David A. Patterson