Sciweavers

4315 search results - page 125 / 863
» Sorting in linear time
Sort
View
SC
1991
ACM
14 years 17 days ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
LREC
2008
130views Education» more  LREC 2008»
13 years 10 months ago
Detecting Co-Derivative Documents in Large Text Collections
We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not ...
Jan Pomikálek, Pavel Rychlý
MST
2002
169views more  MST 2002»
13 years 8 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...
INTERNET
2010
89views more  INTERNET 2010»
13 years 7 months ago
Plenty of Room Outside the Firm
away the still primitive state and expense of computers and foresee the potential of computers that were many times more powerful and cheap. More importantly, Engelbart was much be...
Charles J. Petrie
TCS
2010
13 years 7 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel