Sciweavers

3098 search results - page 429 / 620
» On distributed smooth scheduling
Sort
View
ECML
2003
Springer
15 years 11 months ago
Optimizing Local Probability Models for Statistical Parsing
Abstract. This paper studies the properties and performance of models for estimating local probability distributions which are used as components of larger probabilistic systems â€...
Kristina Toutanova, Mark Mitchell, Christopher D. ...
ASPDAC
1999
ACM
137views Hardware» more  ASPDAC 1999»
15 years 10 months ago
A Performance-Driven I/O Pin Routing Algorithm
This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorith...
Dongsheng Wang, Ping Zhang, Chung-Kuan Cheng, Arun...
HPDC
1996
IEEE
15 years 10 months ago
On-Demand Hypermedia/Multimedia Service over Broadband Networks
In this paper we present a uni ed approach for delivering hypermedia/multimedia objects over broadband networks. Documents are stored in various multimedia servers, while the inli...
Christos Bouras, Vaggelis Kapoulas, D. Miras, Vagg...
VISUALIZATION
1996
IEEE
15 years 10 months ago
Illustrating Transparent Surfaces with Curvature-Directed Strokes
Transparency can be a useful device for simultaneously depicting multiple superimposed layers of information in a single image. However, in computer-generated pictures -as in phot...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer
PODC
1993
ACM
15 years 10 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld