1012 search results - page 69 / 203 » Segment intersection searching problems in general settings |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
DM
2008
14 years 12 months ago
2008
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
TSP
2010
14 years 6 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
CIBCB
2007
IEEE
15 years 3 months ago
2007
IEEE
-- A large and reliable DNA codeword library is the key to the success of DNA based computing. Searching for the set of reliable DNA codewords is an NP-hard problem, which can take...
142
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...