973 search results - page 74 / 195 » New Bounds on Crossing Numbers |
112
click to vote
IPTPS
2003
Springer
15 years 5 months ago
2003
Springer
Koorde1 is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such a...
105
click to vote
ICALP
1999
Springer
15 years 4 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
107
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...
ACTA
2007
15 years 15 hour ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...