Sciweavers

943 search results - page 3 / 189
» How should data structures and algorithms be taught
Sort
View
HCI
2011
14 years 1 months ago
Practical Aspects of Running Experiments with Human Participants
There can often be a gap between theory and its implications for practice in human-behavioral studies. This gap can be particularly significant outside psychology departments. Most...
Frank E. Ritter, Jong W. Kim, Jonathan H. Morgan, ...
INFOCOM
2003
IEEE
15 years 2 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
ISPDC
2006
IEEE
15 years 3 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
W4A
2006
ACM
15 years 3 months ago
How people use presentation to search for a link: expanding the understanding of accessibility on the web
It is well known that many Web pages are difficult for visually disabled people to use. Without access to a rich, visual display, the intended structure and organisation of the pa...
Caroline Jay, Robert Stevens, Mashhuda Glencross, ...
SYNTHESE
2008
84views more  SYNTHESE 2008»
14 years 9 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein