Sciweavers

1640 search results - page 290 / 328
» Conditional Independence Trees
Sort
View
ICALP
2003
Springer
14 years 1 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
INFOCOM
1999
IEEE
14 years 28 days ago
MTCP: Scalable TCP-like Congestion Control for Reliable Multicast
We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multim...
Injong Rhee, Nallathambi Balaguru, George N. Rousk...
ISPAN
1997
IEEE
14 years 26 days ago
A New General Purpose Parallel Database System
This paper is concerned with the transparent parallelisation of declarative database queries, based on theoretical principles. We have designed an entire database architecture sui...
Mohamad Afshar, J. Bates, Gavin M. Bierman, K. Moo...
PVM
1997
Springer
14 years 24 days ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis
COMPGEOM
2007
ACM
14 years 18 days ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir