Sciweavers

15375 search results - page 210 / 3075
» cans 2008
Sort
View
CONCURRENCY
2000
103views more  CONCURRENCY 2000»
13 years 8 months ago
Cooperating distributed garbage collectors for clusters and beyond
The contribution of this paper is twofold. First a distributed garbage collector (DGC) is presented that is optimized for remote method invocation in reliable networks, such as cu...
Michael Philippsen
DCG
2000
94views more  DCG 2000»
13 years 8 months ago
Finding Small Triangulations of Polytope Boundaries Is Hard
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
Jürgen Richter-Gebert
DEBU
2000
96views more  DEBU 2000»
13 years 8 months ago
What do the Neighbours Think? Computing Web Page Reputations
The textual content of the Web enriched with the hyperlink structure surrounding it can be a useful source of information for querying and searching. This paper presents a search ...
Alberto O. Mendelzon, Davood Rafiei
DM
2000
111views more  DM 2000»
13 years 8 months ago
Representations of graphs modulo n
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
Anthony B. Evans, Garth Isaak, Darren A. Narayan
CONNECTION
2002
58views more  CONNECTION 2002»
13 years 8 months ago
Providing social scaffolding for effective agent communities
This paper explores the general landscape of virtual communities and reflects upon their relevance to their agent community counterparts. It examines several disparate virtual com...
Gregory M. P. O'Hare