Sciweavers

943 search results - page 10 / 189
» How should data structures and algorithms be taught
Sort
View
VLDB
1989
ACM
107views Database» more  VLDB 1989»
15 years 6 months ago
Scheduling Real-Time Transactions with Disk Resident Data
Managingtransactionswith real-timerequirements and disk residentdata presentsmany new problems.In thispaperweaddressseveral:How canwe scheduletransactionswith deadlines?How do the...
Robert K. Abbott, Hector Garcia-Molina
ACL
2008
15 years 4 months ago
Mining Wiki Resources for Multilingual Named Entity Recognition
In this paper, we describe a system by which the multilingual characteristics of Wikipedia can be utilized to annotate a large corpus of text with Named Entity Recognition (NER) t...
Alexander E. Richman, Patrick Schone
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
15 years 3 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
SIGITE
2005
ACM
15 years 8 months ago
Teaching 2D arrays using real-time video filters
Educators have long been trying to spice things up in their introductory programming courses. Traditionally, twodimensional arrays have been taught non-graphically using contrived...
Jeffrey W. Chastine, Jon A. Preston
130
Voted
WDAG
2004
Springer
88views Algorithms» more  WDAG 2004»
15 years 7 months ago
Nonblocking Concurrent Data Structures with Condition Synchronization
We apply the classic theory of linearizability to operations that must wait for some other thread to establish a precondition. We model such an operation as a request and a follow-...
William N. Scherer III, Michael L. Scott