Sciweavers

113 search results - page 8 / 23
» Obnoxious Centers in Graphs
Sort
View
AAAI
2007
13 years 9 months ago
GRIN: A Graph Based RDF Index
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....
Octavian Udrea, Andrea Pugliese, V. S. Subrahmania...
IPPS
2007
IEEE
14 years 1 months ago
Optimal Assignment of a Tree-Structured Context Reasoning Procedure onto a Host-Satellites System
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
Hailiang Mei, Pravin Pawar, Ing Widya
ICSM
2006
IEEE
14 years 22 days ago
Software Feature Understanding in an Industrial Setting
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
Michael Jiang, Michael Groble, Sharon Simmons, Den...
TIT
1998
127views more  TIT 1998»
13 years 6 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...
EUROSYS
2007
ACM
14 years 3 months ago
Dryad: distributed data-parallel programs from sequential building blocks
Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational “vertices” with communication ...
Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrel...