2485 search results - page 85 / 497 » Time Bounded Frequency Computations |
138
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
117
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
143
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...
138
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
128
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...