2434 search results - page 290 / 487 » Algorithmic Randomness of Closed Sets |
171
click to vote
EUROPAR
2009
Springer
15 years 1 months ago
2009
Springer
Unstructured overlay networks for peer-to-peer applications combined with stochastic algorithms for clustering and resource location are attractive due to low-maintenance costs and...
134
click to vote
JMLR
2010
14 years 10 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
123
click to vote
ECCV
1996
Springer
16 years 5 months ago
1996
Springer
An approach is presented for imposing generic hard constraints on deformable models at a low computational cost, while preserving the good convergence properties of snake-like mod...
111
click to vote
DATE
2008
IEEE
15 years 10 months ago
2008
IEEE
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
145
Voted
VTC
2006
IEEE
15 years 10 months ago
2006
IEEE
— In the third generation wireless system UMTS, Radio Resource Management (RRM) functions should encompass scheduling algorithms. In particular, scheduling mechanisms play a key ...