Sciweavers

14248 search results - page 2736 / 2850
» Queries
Sort
View
FOCS
1990
IEEE
14 years 2 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
VLDB
1989
ACM
98views Database» more  VLDB 1989»
14 years 2 months ago
A Family of Incomplete Relational Database Models
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
Adegbemiga Ola, Gultekin Özsoyoglu
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 2 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
ACMICEC
2007
ACM
154views ECommerce» more  ACMICEC 2007»
14 years 2 months ago
Learning and adaptivity in interactive recommender systems
Recommender systems are intelligent E-commerce applications that assist users in a decision-making process by offering personalized product recommendations during an interaction s...
Tariq Mahmood, Francesco Ricci
APWEB
2007
Springer
14 years 2 months ago
DBMSs with Native XML Support: Towards Faster, Richer, and Smarter Data Management
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...
Min Wang
« Prev « First page 2736 / 2850 Last » Next »