2397 search results - page 69 / 480 » Applications of integer relation algorithms |
102
click to vote
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
CIAC
1997
Springer
15 years 1 months ago
1997
Springer
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
COMGEO
2010
ACM
14 years 10 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
PEPM
2010
ACM
15 years 6 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...