Sciweavers

3946 search results - page 369 / 790
» The computational complexity of choice sets
Sort
View
RECOMB
2008
Springer
16 years 7 months ago
CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads
A major hindrance to studies of microbial diversity has been that the vast majority of microbes cannot be cultured in the laboratory and thus are not amenable to traditional method...
Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, ...
CSE
2009
IEEE
16 years 1 months ago
The Importance of Data Collection for Modelling Contact Networks
—The recently developed small wireless devices ranging from sensor boards to mobile phones provide a timely opportunity to gather unique data sets on complex human interactions, ...
Eiko Yoneki
VISUALIZATION
2002
IEEE
15 years 11 months ago
Geometric Surface Smoothing via Anisotropic Diffusion of Normals
This paper introduces a method for smoothing complex, noisy surfaces, while preserving (and enhancing) sharp, geometric features. It has two main advantages over previous approach...
Tolga Tasdizen, Ross T. Whitaker, Paul Burchard, S...
ICALP
1992
Springer
15 years 11 months ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
JCSS
2010
112views more  JCSS 2010»
15 years 5 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn