Sciweavers

2745 search results - page 89 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
194
Voted
CVPR
2012
IEEE
13 years 6 months ago
Learning latent temporal structure for complex event detection
In this paper, we tackle the problem of understanding the temporal structure of complex events in highly varying videos obtained from the Internet. Towards this goal, we utilize a...
Kevin Tang, Fei-Fei Li, Daphne Koller
127
Voted
SPIN
2009
Springer
15 years 10 months ago
Fast, All-Purpose State Storage
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
Peter C. Dillinger, Panagiotis Manolios
150
Voted
ICMCS
2005
IEEE
124views Multimedia» more  ICMCS 2005»
15 years 9 months ago
Fast inter frame encoding based on modes pre-decision in H.264
The new video coding standard, H.264 allows motion estimation performing on tree-structured block partitioning and multiple reference frames. This feature improves the prediction ...
Dongming Zhang, Yanfei Shen, Shouxun Lin, Yongdong...
129
Voted
IPPS
1999
IEEE
15 years 7 months ago
Large Scale Simulation of Particulate Flows
Simulations of particles in fluid flows are of great interest to numerous industries using sedimentation, fluidization, lubricated transport, and hydraulic fracturing of hydrocarb...
Ahmed H. Sameh, Vivek Sarin
139
Voted
SIGMOD
2012
ACM
246views Database» more  SIGMOD 2012»
13 years 6 months ago
Skimmer: rapid scrolling of relational query results
A relational database often yields a large set of tuples as the result of a query. Users browse this result set to find the information they require. If the result set is large, ...
Manish Singh, Arnab Nandi, H. V. Jagadish