93 search results - page 10 / 19 » Fast Monte-Carlo Algorithms for Finding Low-Rank Approximati... |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
VMV
2004
13 years 8 months ago
2004
Visualizing iso-surfaces of volumetric data sets is becoming increasingly important for many practical applications. One crucial task in iso-surface ray tracing is to find the cor...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
TON
2008
13 years 7 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...