1192 search results - page 118 / 239 » Computing Weakest Readings |
122
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
123
Voted
SUTC
2006
IEEE
15 years 9 months ago
2006
IEEE
We examine the problem of detecting the direction of motion in a binary sensor network; in such a network each sensor’s value is supplied reliably in a single bit of information...
117
Voted
CSMR
2005
IEEE
15 years 9 months ago
2005
IEEE
Software developers are constantly required to modify and adapt application features in response to changing requirements. The problem is that just by reading the source code, it ...
119
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
TreePlus is a graph browsing technique based on a tree-style layout. It shows the missing graph structure using interaction techniques and enables users to start with a specific no...
110
Voted
MIDDLEWARE
2005
Springer
15 years 9 months ago
2005
Springer
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Dual-quorum replication combines volume leases and qu...