Sciweavers

55 search results - page 2 / 11
» Scanpath comparison revisited
Sort
View
JLP
2010
96views more  JLP 2010»
13 years 3 months ago
Implicit characterizations of FPTIME and NC revisited
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
Karl-Heinz Niggl, Henning Wunderlich
ICALP
2009
Springer
14 years 5 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
ICPR
2008
IEEE
14 years 6 months ago
An empirical comparison of graph-based dimensionality reduction algorithms on facial expression recognition tasks
Facial expression recognition is a topic of interest both in industry and academia. Recent approaches to facial expression recognition are based on mapping expressions to low dime...
José Miguel Buenaposada, Li He, Luis Baumel...
PDIS
1993
IEEE
13 years 9 months ago
Nested Loops Revisited
The research communityhas considered hash-based parallel joinalgorithmsthe algorithmsof choice for almosta decade. However, almostnone ofthe commercialparallel database systems us...
David J. DeWitt, Jeffrey F. Naughton, Joseph Burge...
TPDS
2008
111views more  TPDS 2008»
13 years 5 months ago
Comments on "Optimal Resource Allocation in Overlay Multicast"
In this comments paper, we revisit the network model introduced in [1]. We discuss the inaccuracy of the model and, to correct the network model, we propose to apply directed capac...
Jinyao Yan, Martin May, Bernhard Plattner