3208 search results - page 288 / 642 » A Lower Bound for Primality |
172
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
184
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
159
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
144
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—We propose (σ, ρ)-based flow regulation as a design instrument for System-on-Chip (SoC) architects to control quality-of-service and achieve cost-effective communicat...
172
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...