Sciweavers

4650 search results - page 788 / 930
» Generating and evaluating evaluative arguments
Sort
View
WWW
2008
ACM
16 years 2 months ago
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
Simon Schenk, Steffen Staab
WWW
2006
ACM
16 years 2 months ago
Searching with context
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
Reiner Kraft, Chi-Chao Chang, Farzin Maghoul, Ravi...
PPOPP
2009
ACM
16 years 2 months ago
MPIWiz: subgroup reproducible replay of mpi applications
Message Passing Interface (MPI) is a widely used standard for managing coarse-grained concurrency on distributed computers. Debugging parallel MPI applications, however, has alway...
Ruini Xue, Xuezheng Liu, Ming Wu, Zhenyu Guo, Weng...
KDD
2009
ACM
219views Data Mining» more  KDD 2009»
16 years 2 months ago
Structured correspondence topic models for mining captioned figures in biological literature
A major source of information (often the most crucial and informative part) in scholarly articles from scientific journals, proceedings and books are the figures that directly pro...
Amr Ahmed, Eric P. Xing, William W. Cohen, Robert ...
111
Voted
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 2 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson