2485 search results - page 396 / 497 » Time Bounded Frequency Computations |
COMPGEOM
2005
ACM
13 years 10 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
GPEM
2008
13 years 8 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
MOBIHOC
2008
ACM
14 years 7 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...