Sciweavers

1326 search results - page 249 / 266
» Adaptable Similarity Search using Non-Relevant Information
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 11 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
FAST
2010
13 years 10 months ago
Discovery of Application Workloads from Network File Traces
An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level he...
Neeraja J. Yadwadkar, Chiranjib Bhattacharyya, K. ...
COMPUTER
2000
180views more  COMPUTER 2000»
13 years 7 months ago
The Challenges of Automatic Summarization
tion--the art of abstracting key content from one or more information sources--has become an integral part of everyday life. People keep abreast of world affairs by listening to ne...
Udo Hahn, Inderjeet Mani
COOPIS
2002
IEEE
14 years 16 days ago
Discovering Emergent Virtual Work Processes in Collaborative Systems
The design of virtual workplaces that can support virtual work processes has traditionally been either ad-hoc, or has been influenced by the top-down approaches, such as ‘virtua...
Simeon J. Simoff, Robert P. Biuk-Aghai
SIGUCCS
2005
ACM
14 years 1 months ago
Developing a synchronous web seminar application for online learning
Many higher education institutions are searching for cost effective tools for the delivery of a feature rich, synchronous online learning environment. While there are several comm...
Michael D. Ciocco, Neil Toporski, Michael Dorris