Sciweavers

6365 search results - page 345 / 1273
» Fast Local Computation Algorithms
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
Fast Overlapping Group Lasso
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...
Jun Liu, Jieping Ye
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
TSMC
2008
138views more  TSMC 2008»
15 years 6 months ago
Fast Diagnosis With Sensors of Uncertain Quality
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
Ozgur Erdinc, Craig Brideau, Peter Willett, Thiaga...
ICIAR
2010
Springer
15 years 4 months ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...
NETGAMES
2004
ACM
16 years 5 days ago
Realizing bullet time effect in multiplayer games with local perception filters
Local perception filters exploit the limitations of human perception to reduce the effects of network latency in multiplayer computer games. Because they allow temporal distorti...
Jouni Smed, Henrik Niinisalo, Harri Hakonen