2496 search results - page 376 / 500 » On covering by translates of a set |
188
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
168
click to vote
PDP
2007
IEEE
16 years 22 days ago
2007
IEEE
The success of groupware software largely depends on its capability for being reused in different collaborative scenarios without requiring significant software development effort...
209
click to vote
HT
1993
ACM
15 years 10 months ago
1993
ACM
Traditional concurrency control techniques for database systems (transaction management based on locking protocols) have been successful in many multiuser settings, but these tech...
178
click to vote
DASFAA
2004
IEEE
15 years 10 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
162
click to vote
JUCS
2007
15 years 6 months ago
2007
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...