Sciweavers

48 search results - page 10 / 10
» Subquadratic Algorithms for 3SUM
Sort
View
COMPGEOM
2005
ACM
13 years 7 months ago
Kinetic sorting and kinetic convex hulls
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...
Mohammad Ali Abam, Mark de Berg
BMCBI
2010
104views more  BMCBI 2010»
13 years 5 months ago
Bidirectional best hit r-window gene clusters
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...
Melvin Zhang, Hon Wai Leong
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 6 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams