Sciweavers

2814 search results - page 416 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
SIGKDD
2008
125views more  SIGKDD 2008»
13 years 10 months ago
Incremental pattern discovery on streams, graphs and tensors
Incremental pattern discovery targets streaming applications where the data continuously arrive incrementally. The questions are how to find patterns (main trends) incrementally; ...
Jimeng Sun
JCDL
2011
ACM
272views Education» more  JCDL 2011»
13 years 1 months ago
CollabSeer: a search engine for collaboration discovery
Collaborative research has been increasingly popular and important in academic circles. However, there is no open platform available for scholars or scientists to effectively dis...
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, Clyde ...
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
14 years 10 months ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
OTM
2009
Springer
14 years 4 months ago
LinksB2N: Automatic Data Integration for the Semantic Web
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
Manuel Salvadores, Gianluca Correndo, Bene Rodrigu...
ICCCN
2007
IEEE
14 years 4 months ago
Utility-Based Routing in Communication Networks with Unstable Links
Abstract—Traditional Dijkstra and Bellman-Ford routing algorithms can only provide the best route to each destination based on a fixed link cost model. We propose a utility-base...
Mingming Lu, Jie Wu