973 search results - page 63 / 195 » New Bounds on Crossing Numbers |
207
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
157
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Abstract. A very challenging problem in the genetics domain is to infer haplotypes from genotypes. This process is expected to identify genes affecting health, disease and response...
157
click to vote
COCO
2007
Springer
16 years 9 days ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
157
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
167
click to vote
IPPS
2006
IEEE
16 years 5 days ago
2006
IEEE
The earliest-deadline-first (EDF) scheduling of a sporadic real-time task system on a multiprocessor may require that the total utilization of the task system, Usum, not exceed (...