2044 search results - page 206 / 409 » System theory for numerical analysis |
164
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
170
click to vote
HPCC
2009
Springer
15 years 11 months ago
2009
Springer
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
187
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
192
click to vote
NIPS
2004
15 years 8 months ago
2004
An important aspect of clustering algorithms is whether the partitions constructed on finite samples converge to a useful clustering of the whole data space as the sample size inc...
167
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
Local computation in join trees or acyclic hypertrees has been shown to be linked to a particular algebraic structure, called valuation algebra. There are many models of this alge...