Sciweavers

16404 search results - page 150 / 3281
» A set coverage problem
Sort
View
PPOPP
2012
ACM
13 years 11 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
BCB
2010
156views Bioinformatics» more  BCB 2010»
14 years 10 months ago
RepFrag: a graph based method for finding repeats and transposons from fragmented genomes
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
Nirmalya Bandyopadhyay, A. Mark Settles, Tamer Kah...
125
Voted
ICIP
2001
IEEE
16 years 5 months ago
A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
Abdol-Reza Mansouri, Thierry Chomaud, Janusz Konra...
LPNMR
2009
Springer
15 years 8 months ago
Computing Weighted Solutions in Answer Set Programming
For some problems with many solutions, like planning and phylogeny reconstruction, one way to compute more desirable solutions is to assign weights to solutions, and then pick the ...
Duygu Çakmak, Esra Erdem, Halit Erdogan
AROBOTS
2004
104views more  AROBOTS 2004»
15 years 3 months ago
A Set Theoretic Approach to Dynamic Robot Localization and Mapping
This paper addresses the localization and mapping problem for a robot moving through a (possibly) unknown environment where indistinguishable landmarks can be detected. A set theo...
Mauro Di Marco, Andrea Garulli, Antonio Giannitrap...