724 search results - page 114 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
118
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Existing research on mining quantitative databases mainly focuses on mining associations. However, mining associations is too expensive to be practical in many cases. In this pape...
155
click to vote
AINA
2006
IEEE
15 years 9 months ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
132
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
128
click to vote
TCS
2008
15 years 3 months ago
2008
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
125
click to vote
SSWMC
2004
15 years 4 months ago
2004
A possible solution to the difficult problem of geometrical distortion of watermarked images in a blind watermarking scenario is to use a template grid in the autocorrelation func...