724 search results - page 68 / 145 » Practical Performance of Efficient Minimum Cut Algorithms |
SIGMOD
2001
ACM
15 years 12 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
EVOW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
HICSS
2006
IEEE
15 years 5 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
AAAI
2010
15 years 1 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
ASPDAC
2001
ACM
15 years 3 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...