Sciweavers

439 search results - page 84 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
AVI
2010
13 years 9 months ago
Wakame: sense making of multi-dimensional spatial-temporal data
As our ability to measure the world around us improves, we are quickly generating massive quantities of high-dimensional, spatial-temporal data. In this paper, we concern ourselve...
Clifton Forlines, Kent Wittenburg
DC
2011
12 years 7 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
WWW
2006
ACM
14 years 8 months ago
Constructing virtual documents for ontology matching
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in t...
Yuzhong Qu, Wei Hu, Gong Cheng
SASP
2008
IEEE
183views Hardware» more  SASP 2008»
14 years 2 months ago
Application Acceleration with the Explicitly Parallel Operations System - the EPOS Processor
Different approaches have been proposed over the years for automatically transforming High-Level-Languages (HLL) descriptions of applications into custom hardware implementations. ...
Alexandros Papakonstantinou, Deming Chen, Wen-mei ...