Sciweavers

1391 search results - page 145 / 279
» Complexity Limitations on Quantum Computation
Sort
View
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 3 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...
KI
2010
Springer
13 years 2 months ago
Lifelong Map Learning for Graph-based SLAM in Static Environments
In this paper, we address the problem of lifelong map learning in static environments with mobile robots using the graph-based formulation of the simultaneous localization and mapp...
Henrik Kretzschmar, Giorgio Grisetti, Cyrill Stach...
TCAD
2010
168views more  TCAD 2010»
13 years 2 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
ICASSP
2011
IEEE
12 years 11 months ago
Cooperative sensing in cognitive networks under malicious attack
Abstract—This paper considers cooperative sensing in cognitive networks under Spectrum Sensing Data Falsification attack (SSDF) in which malicious users can intentionally send f...
Mai Abdelhakim, Lei Zhang, Jian Ren, Tongtong Li
CVPR
2004
IEEE
14 years 10 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell