Sciweavers

3740 search results - page 190 / 748
» A Fast Skeletonization Method
Sort
View
CVPR
2007
IEEE
15 years 23 days ago
Fast, Approximately Optimal Solutions for Single and Dynamic MRFs
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
Nikos Komodakis, Georgios Tziritas, Nikos Paragios
ICML
2001
IEEE
14 years 11 months ago
Learning to Generate Fast Signal Processing Implementations
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
Bryan Singer, Manuela M. Veloso
ECRTS
2005
IEEE
14 years 4 months ago
Fast and Tight Response-Times for Tasks with Offsets
In previous work, we presented a tight approximate response-time analysis for tasks with offsets. While providing a tight bound on response times, the tight analysis exhibits simi...
Jukka Mäki-Turja, Mikael Nolin
AUSAI
2001
Springer
14 years 2 months ago
Fast Text Classification Using Sequential Sampling Processes
A central problem in information retrieval is the automated classification of text documents. While many existing methods achieve good levels of performance, they generally require...
Michael D. Lee
ICDIM
2008
IEEE
14 years 5 months ago
NIDS based on payload word frequencies and anomaly of transitions
This paper presents a novel payload analysis method. Consecutive bytes are separated by boundary symbols and defined as words. The frequencies of word appearance and word to word ...
Sasa Mrdovic, Branislava Perunicic