Sciweavers

9611 search results - page 320 / 1923
» A Note on Difference Sets
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries
Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of ...
Jeremy Kubica, Andrew W. Moore, David Cohn, Jeff G...
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
16 years 7 months ago
Frequent pattern mining with uncertain data
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wan...
EDBT
2006
ACM
116views Database» more  EDBT 2006»
16 years 6 months ago
VICO: Visualizing Connected Object Orderings
In modern databases, complex objects like multimedia data, proteins or text objects can be modeled in a variety of representations and can be decomposed into multiple instances of ...
Stefan Brecheisen, Hans-Peter Kriegel, Matthias Sc...
IPPS
2007
IEEE
16 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
SEMWEB
2007
Springer
16 years 24 days ago
Results of the Ontology Alignment Evaluation Initiative 2007
Abstract. Ontology matching consists of finding correspondences between ontology entities. OAEI campaigns aim at comparing ontology matching systems on precisely defined test set...
Jérôme Euzenat, Antoine Isaac, Christ...