Sciweavers

861 search results - page 159 / 173
» Polymorphic Time Systems for Estimating Program Complexity
Sort
View
SCFBM
2008
104views more  SCFBM 2008»
13 years 7 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, ...
GLOBECOM
2009
IEEE
13 years 10 months ago
Compressed Sensing Reception of Bursty UWB Impulse Radio is Robust to Narrow-Band Interference
—We have recently proposed a novel receiver for Ultra-Wide-band Impulse-Radio communication in bursty applications like Wireless Sensor Networks. The receiver, based on the princ...
Anand Oka, Lutz H.-J. Lampe
WWW
2003
ACM
14 years 8 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
ATAL
2010
Springer
13 years 8 months ago
Coalition formation with spatial and temporal constraints
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Central to this endeavour is...
Sarvapali D. Ramchurn, Maria Polukarov, Alessandro...
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner