1632 search results - page 61 / 327 » Sublinear Time Algorithms for Metric Space Problems |
141
Voted
JAIR
2000
15 years 3 months ago
2000
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled tempo...
157
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
153
click to vote
PE
2010
Springer
15 years 1 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
140
click to vote
SODA
1998
ACM
15 years 4 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...