Sciweavers

191 search results - page 13 / 39
» The standing ovation problem
Sort
View
BMCBI
2010
106views more  BMCBI 2010»
13 years 2 months ago
Identification and correction of previously unreported spatial phenomena using raw Illumina BeadArray data
Background: A key stage for all microarray analyses is the extraction of feature-intensities from an image. If this step goes wrong, then subsequent preprocessing and processing s...
Mike L. Smith, Mark J. Dunning, Simon Tavaré...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine

Source Code
9636views
15 years 8 months ago
2D-3D Automatic Mesh Generation
NETGEN is an open source automatic mesh generation tool for two and three dimensions. It comes as a stand alone program with graphical user interface, or as a C++ library to be lin...
Joachim Schöberl
EDBT
2006
ACM
137views Database» more  EDBT 2006»
14 years 7 months ago
Data Mapping as Search
In this paper, we describe and situate the TUPELO system for data mapping in relational databases. Automating the discovery of mappings between structured data sources is a long st...
George H. L. Fletcher, Catharine M. Wyss
ATAL
2007
Springer
14 years 1 months ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros