2783 search results - page 359 / 557 » The Nature Of Near-Synonymic Relations |
132
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
121
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
119
click to vote
MUM
2009
ACM
15 years 8 months ago
2009
ACM
There are academic and commercial drivers for contextawareness to play a prominent role in the future of mobile services. Implementing a complete model of context remains an unsol...
129
click to vote
PADS
2009
ACM
15 years 8 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...
114
click to vote
BIRTHDAY
2009
Springer
15 years 8 months ago
2009
Springer
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...