208 search results - page 41 / 42 » Computing Anonymously with Arbitrary Knowledge |
INFOCOM
2003
IEEE
14 years 7 days ago
2003
IEEE
— In this paper we consider the problem of collecting a large amount of data from several different hosts to a single destination in a wide-area network. Often, due to congestion...
FMCAD
2008
Springer
13 years 8 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
IPCO
2001
13 years 8 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
TIP
2008
13 years 6 months ago
2008
This paper presents a connected coherence tree algorithm (CCTA) for image segmentation with no prior knowledge. It aims to find regions of semantic coherence based on the proposed ...
BMCBI
2004
13 years 6 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...