721 search results - page 96 / 145 » Graphs with Large Obstacle Numbers |
192
click to vote
COR
2008
15 years 5 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
226
click to vote
MP
2011
15 years 29 days ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
196
click to vote
CPM
1993
Springer
15 years 10 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
198
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
159
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
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...