Sciweavers

336 search results - page 23 / 68
» Improved data structures for fully dynamic biconnectivity
Sort
View
PKDD
2009
Springer
170views Data Mining» more  PKDD 2009»
15 years 6 months ago
Statistical Relational Learning with Formal Ontologies
Abstract. We propose a learning approach for integrating formal knowledge into statistical inference by exploiting ontologies as a semantically rich and fully formal representation...
Achim Rettinger, Matthias Nickles, Volker Tresp
CODES
2011
IEEE
13 years 11 months ago
Dynamic, multi-core cache coherence architecture for power-sensitive mobile processors
Today, mobile smartphones are expected to be able to run the same complex, memory-intensive applications that were originally designed and coded for general-purpose processors. Ho...
Garo Bournoutian, Alex Orailoglu
WSDM
2009
ACM
178views Data Mining» more  WSDM 2009»
15 years 6 months ago
User Browsing Graph: Structure, Evolution and Application
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
Yiqun Liu, Min Zhang, Shaoping Ma, Liyun Ru
110
Voted
CIKM
2006
Springer
15 years 1 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 11 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...