4679 search results - page 415 / 936 » Modeling When Connections Are the Problem |
196
click to vote
JMLR
2010
15 years 1 months ago
2010
This paper aims to tackle the very interesting and important problem of user personalized ranking of search results. The focus is on news retrieval and the data from which the ran...
218
click to vote
FLAIRS
2007
15 years 9 months ago
2007
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
146
click to vote
CHI
2001
ACM
16 years 7 months ago
2001
ACM
The advent of second-generation intelligent computer tutors raises an important instructional design question: when should tutorial advice be presented in problem solving? This pa...
188
Voted
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
216
click to vote
CVGIP
2002
15 years 6 months ago
2002
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...