Sciweavers

85 search results - page 9 / 17
» Some Common Pitfalls in the Design of Ontology-driven Inform...
Sort
View
JDA
2006
184views more  JDA 2006»
13 years 7 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano
CIKM
2009
Springer
14 years 2 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
RECSYS
2010
ACM
13 years 7 months ago
Interactive recommendations in social endorsement networks
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
Theodoros Lappas, Dimitrios Gunopulos
CANDC
2009
ACM
14 years 1 months ago
Visualization and empowerment
Data visualization, commonly used to make large sets of numerical data more legible, also has enormous potential as a storytelling tool to elicit insights on long-standing social ...
Indhira Rojas, Wendy Ju
ISPAN
2005
IEEE
14 years 1 months ago
An Efficient MPI-IO for Noncontiguous Data Access over InfiniBand
Noncontiguous data access is a very common access pattern in many scientific applications. Using POSIX I/O to access many pieces of noncontiguous data segments will generate a lot...
Ding-Yong Hong, Ching-Wen You, Yeh-Ching Chung