Sciweavers

2635 search results - page 466 / 527
» Algorithms for the Database Layout Problem
Sort
View
122
Voted
WWW
2004
ACM
16 years 3 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
119
Voted
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 3 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
116
Voted
CIKM
2005
Springer
15 years 8 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 6 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
132
Voted
ISEMANTICS
2010
15 years 4 months ago
Foundations of data interoperability on the web: a web science perspective
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...
Hamid Haidarian Shahri