Sciweavers

6328 search results - page 351 / 1266
» From Quantity to Quality
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
TC
1998
15 years 6 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
NAR
2007
132views more  NAR 2007»
15 years 6 months ago
Expanded protein information at SGD: new pages and proteome browser
The recent explosion in protein data generated from both directed small-scale studies and largescale proteomics efforts has greatly expanded the quantity of available protein info...
Robert S. Nash, Shuai Weng, Benjamin C. Hitz, Rama...
SCFBM
2008
104views more  SCFBM 2008»
15 years 6 months ago
A Perl toolkit for LIMS development
Background: High throughput laboratory techniques generate huge quantities of scientific data. Laboratory Information Management Systems (LIMS) are a necessary requirement, dealin...
James A. Morris, Simon A. Gayther, Ian J. Jacobs, ...
SCHOLARPEDIA
2010
80views more  SCHOLARPEDIA 2010»
15 years 5 months ago
Working memory
—Studies of attention and working memory address the fundamental limits in our ability to encode and maintain behaviorally relevant information, processes that are critical for g...
Alan Baddeley