Sciweavers

3092 search results - page 504 / 619
» Where are you pointing
Sort
View
BMCBI
2010
151views more  BMCBI 2010»
13 years 9 months ago
Data reduction for spectral clustering to analyze high throughput flow cytometry data
Background: Recent biological discoveries have shown that clustering large datasets is essential for better understanding biology in many areas. Spectral clustering in particular ...
Habil Zare, Parisa Shooshtari, Arvind Gupta, Ryan ...
BMCBI
2008
125views more  BMCBI 2008»
13 years 9 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
CGA
2008
13 years 9 months ago
Mobile 3D City Maps
ion and abstraction. By the end of the 20th century, technology had advanced to the point where computerized methods had revolutionized surveying and mapmaking practices. Now, the ...
Antti Nurminen
CGF
2008
124views more  CGF 2008»
13 years 9 months ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 9 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder