Sciweavers

1170 search results - page 79 / 234
» How Fast Is Too Fast
Sort
View
DAGSTUHL
1997
15 years 4 months ago
InVIS - Interactive Visualization of Medical Data Sets
Interactive rendering of large data sets requires fast algorithms and rapid hardware acceleration. Both can be improved, but none of this ensures interactive response times. If a ...
Jörg Meyer, Steffen Gelder, Timna E. Schneide...
ICASSP
2010
IEEE
15 years 3 months ago
Subpixel motion estimation without interpolation
We propose a fast subpixel motion estimation method for motion deblurring, where conventional motion estimation algorithms used in video codings are too complex. The new algorithm...
Stanley H. Chan, Dung Trung Vo, Truong Q. Nguyen
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 3 months ago
iSAX: indexing and mining terabyte sized time series
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the ...
Jin Shieh, Eamonn J. Keogh
GRAPHICSINTERFACE
2000
15 years 4 months ago
Model Simplification Through Refinement
As modeling and visualization applications proliferate, there arises a need to simplify large polygonal models at interactive rates. Unfortunately existing polygon mesh simplifica...
Dmitry Brodsky, Benjamin Watson
COMAD
2009
15 years 4 months ago
Epsilon Equitable Partition: A positional analysis method for large social networks
Positional analysis is considered an important tool in the analysis of social networks. It involves partitioning of the set of actors into subsets such that actors in a subset are...
Kiran Kate, Balaraman Ravindran