796 search results - page 89 / 160 » A Formalization of ODMG Queries |
WWW
2001
ACM
16 years 1 months ago
2001
ACM
Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best "authorities" for a given topic or query. Wh...
199
click to vote
POPL
2002
ACM
16 years 1 months ago
2002
ACM
Probability distributions are useful for expressing the meanings of probabilistic languages, which support formal modeling of and reasoning about uncertainty. Probability distribu...
101
Voted
ALT
2007
Springer
15 years 9 months ago
2007
Springer
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
92
Voted
SAC
2010
ACM
15 years 7 months ago
2010
ACM
Keyword-based search returns its results without concern for the information needs of users at a particular time. In general, search queries are too short to represent what users ...
106
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...