Sciweavers

2875 search results - page 476 / 575
» Information Retrieval in Structured Domains
Sort
View
ICDE
2010
IEEE
220views Database» more  ICDE 2010»
14 years 10 months ago
Profiling linked open data with ProLOD
Linked open data (LOD), as provided by a quickly growing number of sources constitutes a wealth of easily accessible information. However, this data is not easy to understand. It i...
Christoph Böhm, Felix Naumann, Ziawasch Abedj...
106
Voted
ESWS
2009
Springer
15 years 7 months ago
MoKi: The Enterprise Modelling Wiki
Abstract. Enterprise modelling focuses on the construction of a structured description, the so-called enterprise model, which represents aspects relevant to the activity of an ente...
Chiara Ghidini, Barbara Kump, Stefanie N. Lindstae...
102
Voted
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
16 years 1 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
104
Voted
SPIRE
2009
Springer
15 years 7 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...
90
Voted
LATIN
2010
Springer
15 years 5 months ago
Prize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
MohammadTaghi Hajiaghayi, Arefeh A. Nasri