Sciweavers

2783 search results - page 334 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
156
Voted
SDB
1995
178views Database» more  SDB 1995»
15 years 5 months ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
AAAI
2008
15 years 4 months ago
Clustering via Random Walk Hitting Time on Directed Graphs
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
Mo Chen, Jianzhuang Liu, Xiaoou Tang
ALGOSENSORS
2008
Springer
15 years 3 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
CLIN
2004
15 years 3 months ago
Learning Dutch Coreference Resolution
This paper presents a machine learning approach to the resolution of coreferential relations between nominal constituents in Dutch. It is the first significant automatic approach ...
Véronique Hoste, Walter Daelemans
123
Voted
SBBD
2004
119views Database» more  SBBD 2004»
15 years 3 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link