82 search results - page 12 / 17 » Efficient algorithms for finding critical subgraphs |
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
In service-oriented systems, such as grids and clouds, users are able to outsource complex computational tasks by procuring resources on demand from remote service providers. As th...
ALMOB
2008
13 years 7 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
SMI
1999
IEEE
13 years 11 months ago
1999
IEEE
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
HIS
2008
13 years 8 months ago
2008
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...