Sciweavers

5022 search results - page 103 / 1005
» Data structures and problem solving using Java
Sort
View
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
15 years 10 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
SEMWEB
2005
Springer
15 years 3 months ago
Gnowsis Adapter Framework: Treating Structured Data Sources as Virtual RDF Graphs
The integration of heterogenous data sources is a crucial step for the upcoming semantic web – if existing information is not integrated, where will the data come from that the s...
Leo Sauermann, Sven Schwarz
SIGIR
2006
ACM
15 years 3 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng
JPDC
2008
100views more  JPDC 2008»
14 years 9 months ago
Data-stream-based global event monitoring using pairwise interactions
The problem of global state observation is fundamental to distributed systems and to the analysis of data streams. Many interactions in distributed systems can be analyzed in term...
Punit Chandra, Ajay D. Kshemkalyani
CP
2009
Springer
15 years 10 months ago
Coalition Structure Generation Utilizing Compact Characteristic Function Representations
This paper presents a new way of formalizing the Coalition Structure Generation problem (CSG), so that we can apply constraint optimization techniques to it. Forming effective coal...
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko S...