828 search results - page 82 / 166 » Bounded Hairpin Completion |
RTCSA
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
VLDB
1997
ACM
14 years 2 months ago
1997
ACM
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
AAAI
2008
14 years 12 days ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
COCOON
2005
Springer
14 years 1 days ago
2005
Springer
A c.e. real x is Solovay reducible to another c.e. real y if x can be approximated at least as efficiently as y by means of increasing computable sequences of rational numbers. The...
SIROCCO
2004
13 years 11 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...