Sciweavers

3311 search results - page 32 / 663
» Modeling Relational Data by the Adjacency Model
Sort
View
EMNLP
2010
13 years 7 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 3 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
DSS
2006
140views more  DSS 2006»
13 years 9 months ago
Access control and audit model for the multidimensional modeling of data warehouses
Due to the sensitive data contained in Data Warehouses (DW), it is essential to specify security measures from the early stages of the DW design and enforce them. Traditional acce...
Eduardo Fernández-Medina, Juan Trujillo, Ro...
DEXAW
2004
IEEE
88views Database» more  DEXAW 2004»
14 years 23 days ago
A Possible World Approach to Uncertain Relational Data
Data exchange between embedded systems and other small or large computing devices increases. Since data in different data sources may refer to the same real world objects, data ca...
Ander de Keijzer, Maurice van Keulen
JUCS
2000
76views more  JUCS 2000»
13 years 8 months ago
Mixed Relations as Enriched Semiringal Categories
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
Radu Grosu, Dorel Lucanu, Gheorghe Stefanescu