1632 search results - page 32 / 327 » Sublinear Time Algorithms for Metric Space Problems |
139
click to vote
JCB
2006
15 years 3 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
124
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
144
Voted
ICTAI
2003
IEEE
2003
IEEE
Partitioning of Temporal Planning Problems in Mixed Space Using the Theory of Extended Saddle Points
15 years 8 months ago
We study the partitioning of temporal planning problems formulated as mixed-integer nonlinear programming problems, develop methods to reduce the search space of partitioned subpr...
131
click to vote
ECCC
2008
15 years 3 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
151
click to vote
NETWORKS
2008
15 years 3 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...