Sciweavers

1487 search results - page 210 / 298
» The Computational Complexity of Link Building
Sort
View
ICML
2009
IEEE
16 years 5 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
ISBI
2008
IEEE
16 years 5 months ago
Fast nonlocal filtering applied to electron cryomicroscopy
We present an efficient algorithm for nonlocal image filtering with applications in electron cryomicroscopy. Our denoising algorithm is a rewriting of the recently proposed nonloc...
Alexandre Cunha, Grant J. Jensen, Jérô...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 5 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
127
Voted
HPCA
2006
IEEE
16 years 4 months ago
A decoupled KILO-instruction processor
Building processors with large instruction windows has been proposed as a mechanism for overcoming the memory wall, but finding a feasible and implementable design has been an elu...
Miquel Pericàs, Adrián Cristal, Rube...
CHI
2004
ACM
16 years 4 months ago
I/O brush: drawing with everyday objects as ink
We introduce I/O Brush, a new drawing tool aimed at young children, ages four and up, to explore colors, textures, and movements found in everyday materials by "picking up&qu...
Kimiko Ryokai, Stefan Marti, Hiroshi Ishii