1439 search results - page 143 / 288 » Fast approximation of centrality |
179
click to vote
AVSS
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper presents a background segmentation technique, which is able to process acceptable segmentation masks under fast global illumination changes. The histogram of the frame-...
117
Voted
HAPTICS
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
115
click to vote
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
Multi-stream hidden Markov models (HMMs) have recently been very successful in audio-visual speech recognition, where the audio and visual streams are fused at the final decision...
111
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
112
click to vote
CORR
2007
Springer
15 years 17 days ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...