2924 search results - page 310 / 585 » Lower Bounds in Distributed Computing |
117
click to vote
HPDC
2007
IEEE
15 years 10 months ago
2007
IEEE
Large-scale donation-based distributed infrastructures need to cope with the inherent unreliability of participant nodes. A widely-used work scheduling technique in such environme...
164
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
: While feature selection is very difficult for high dimensional, unstructured data such as face image, it may be much easier to do if the data can be faithfully transformed into l...
109
click to vote
UC
2005
Springer
15 years 10 months ago
2005
Springer
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
124
click to vote
EUROPAR
2001
Springer
15 years 9 months ago
2001
Springer
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...
126
click to vote
WSC
2004
15 years 5 months ago
2004
We develop a hierarchical distributed production planning and control methodology, called DISCS, for a large and unstable semiconductor manufacturing process. The upper layer of D...