Sciweavers

1859 search results - page 365 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 1 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
135
Voted
IJCV
2006
299views more  IJCV 2006»
14 years 9 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
WIMOB
2008
IEEE
15 years 3 months ago
An Ad Hoc Network Infrastructure: Communication and Information Sharing for Emergency Response
— During an emergency response, access to a reliable communication infrastructure is required to exchange accurate information in a timely manner. Various communication technolog...
Raheleh B. Dilmaghani, Ramesh R. Rao
JCDL
2006
ACM
151views Education» more  JCDL 2006»
15 years 3 months ago
Tagging of name records for genealogical data browsing
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
Mike Perrow, David Barber
ICPPW
2002
IEEE
15 years 2 months ago
Hebbian Algorithms for a Digital Library Recommendation System
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
Francis Heylighen, Johan Bollen