48 search results - page 9 / 10 » Subquadratic Algorithms for 3SUM |
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
JMLR
2010
13 years 28 days ago
2010
Many structured information extraction tasks employ collective graphical models that capture interinstance associativity by coupling them with various clique potentials. We propos...
ICDT
2010
ACM
13 years 10 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
GECCO
2007
Springer
14 years 9 days ago
2007
Springer
Recently, advances have been made in continuous, normal– distribution–based Estimation–of–Distribution Algorithms (EDAs) by scaling the variance up from the maximum–like...