973 search results - page 79 / 195 » New Bounds on Crossing Numbers |
111
click to vote
ESCAPE
2007
Springer
15 years 6 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...
EPEW
2006
Springer
15 years 3 months ago
2006
Springer
We propose new techniques to simplify the computation of the cycle times and the absorption times for a large class of PEPA models. These techniques allow us to simplify the model ...
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Haplotype inference has relevant biological applications, and represents a challenging computational problem. Among others, pure parsimony provides a viable modeling appr...
107
click to vote
IJCAI
1989
15 years 1 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...