Sciweavers

2642 search results - page 292 / 529
» Merge-by-Wire: Algorithms and System Support
Sort
View
EUROSYS
2008
ACM
15 years 6 months ago
Efficient guaranteed disk request scheduling with fahrrad
Guaranteed I/O performance is needed for a variety of applications ranging from real-time data collection to desktop multimedia to large-scale scientific simulations. Reservations...
Anna Povzner, Tim Kaldewey, Scott A. Brandt, Richa...
ACL
2006
15 years 5 months ago
A Collaborative Framework for Collecting Thai Unknown Words from the Web
We propose a collaborative framework for collecting Thai unknown words found on Web pages over the Internet. Our main goal is to design and construct a Webbased system which allow...
Choochart Haruechaiyasak, Chatchawal Sangkeettraka...
CIDR
2003
147views Algorithms» more  CIDR 2003»
15 years 5 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 5 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
JTRES
2010
ACM
15 years 4 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...