Sciweavers

9842 search results - page 1383 / 1969
» Problem complexity
Sort
View
BMCBI
2006
138views more  BMCBI 2006»
15 years 7 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
CVPR
2009
IEEE
17 years 2 months ago
Automatic Reconstruction of Cities from Remote Sensor Data
In this paper, we address the complex problem of rapid modeling of large-scale areas and present a novel approach for the automatic reconstruction of cities from remote sensor da...
Charalambos Poullis (CGIT/IMSC/USC), Suya You (Uni...
DAC
2005
ACM
16 years 8 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
DCC
2009
IEEE
16 years 7 months ago
Clustered Reversible-KLT for Progressive Lossy-to-Lossless 3d Image Coding
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
Ian Blanes, Joan Serra-Sagristà
CHI
2005
ACM
16 years 7 months ago
Privacy gradients: exploring ways to manage incidental information during co-located collaboration
This research introduces privacy issues related to the viewing of incidental information during co-located collaboration. Web browsers were the representative application used in ...
Kirstie Hawkey, Kori M. Inkpen
« Prev « First page 1383 / 1969 Last » Next »