Sciweavers

973 search results - page 38 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
2004
Springer
113views Education» more  CORR 2004»
14 years 11 months ago
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
Sándor P. Fekete, Jörg Schepers
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 6 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
RECOMB
2005
Springer
16 years 4 days ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
INFOCOM
2005
IEEE
15 years 5 months ago
New insights from a fixed point analysis of single cell IEEE 802.11 WLANs
— We study a fixed point formalisation of the well known analysis of Bianchi [3]. We provide a significant simplification and generalisation of the analysis. In this more gene...
Anurag Kumar, Eitan Altman, Daniele Miorandi, Muni...
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
15 years 4 months ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...