Sciweavers

1872 search results - page 372 / 375
» The Art of Granular Computing
Sort
View
AI
2011
Springer
13 years 2 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
CCR
2011
13 years 2 months ago
The politecast communication primitive for low-power wireless
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
Marcus Lundén, Adam Dunkels
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...
BMCBI
2011
12 years 11 months ago
Efficient alignment of pyrosequencing reads for re-sequencing applications
Background: Over the past few years, new massively parallel DNA sequencing technologies have emerged. These platforms generate massive amounts of data per run, greatly reducing th...
Francisco Fernandes, Paulo G. S. da Fonseca, Lu&ia...
PAMI
2011
12 years 10 months ago
The Effect of Border Noise on the Performance of Projection-Based Page Segmentation Methods
— Projection methods have been used in the analysis of bi-tonal document images for different tasks like page segmentation and skew correction for over two decades. However, thes...
Faisal Shafait, Thomas M. Breuel