Sciweavers

1350 search results - page 116 / 270
» Generalized Committed Choice
Sort
View
136
Voted
ENTCS
2008
95views more  ENTCS 2008»
15 years 4 months ago
A Rule-based Method to Match Software Patterns Against UML Models
In a UML model, different aspects of a system are covered by different types of diagrams and this bears the risk that an overall system specification becomes barely tractable by t...
Demis Ballis, Andrea Baruzzo, Marco Comini
CSDA
2006
117views more  CSDA 2006»
15 years 4 months ago
GACV for quantile smoothing splines
Quantile smoothing splines provide nonparametric estimation of conditional quantile functions. Like other nonparametric smoothing techniques, the choice of smoothing parameters co...
Ming Yuan
GRID
2006
Springer
15 years 4 months ago
ROAM: An Authorization Manager for Grids
The Resource Oriented Authorization Manager (ROAM) was created to provide a simple but flexible authorization system for the FusionGrid computational grid. ROAM builds on and exte...
Justin Burruss, T. W. Fredian, Mary R. Thompson
JGT
2008
55views more  JGT 2008»
15 years 4 months ago
Ore-type degree conditions for a graph to be H-linked
Given a fixed multigraph H with V (H) = {h1, . . . , hm}, we say that a graph G is H-linked if for every choice of m vertices v1, . . . , vm in G, there exists a subdivision of H i...
Alexandr V. Kostochka, Gexin Yu
JACM
2006
112views more  JACM 2006»
15 years 4 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...