108 search results - page 16 / 22 » On Computing the Centroid of the Vertices of an Arrangement ... |
ICCAD
2005
IEEE
14 years 4 months ago
2005
IEEE
Abstract— A Kauffman network is an abstract model of gene regulatory networks. Each gene is represented by a vertex. An edge from one vertex to another implies that the former ge...
SAC
2004
ACM
14 years 27 days ago
2004
ACM
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
VTC
2008
IEEE
14 years 1 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
STACS
2004
Springer
14 years 24 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...