973 search results - page 154 / 195 » New Bounds on Crossing Numbers |
139
click to vote
SOFSEM
2007
Springer
16 years 7 days ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...
145
click to vote
WADS
2007
Springer
16 years 7 days ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
150
click to vote
INFOCOM
2006
IEEE
16 years 4 days ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
140
click to vote
ASPDAC
2006
ACM
16 years 3 days ago
2006
ACM
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
153
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
A t-private private information retrieval (PIR) scheme allows a user to retrieve the ith bit of an n-bit string x replicated among k servers, while any coalition of up to t server...