973 search results - page 187 / 195 » New Bounds on Crossing Numbers |
200
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
116
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
116
click to vote
AB
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
112
Voted
ANCS
2007
ACM
15 years 5 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
125
Voted
EMSOFT
2009
Springer
15 years 5 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...