207 search results - page 35 / 42 » Run-Time Switching Between Total Order Algorithms |
CHI
2009
ACM
14 years 2 months ago
2009
ACM
Eliciting user preferences for large datasets and creating rankings based on these preferences has many practical applications in community-based sites. This paper gives a new met...
ADBIS
2003
Springer
14 years 19 days ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
DM
2006
13 years 7 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
SSDBM
2010
IEEE
14 years 14 days ago
2010
IEEE
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
EJWCN
2010
13 years 2 months ago
2010
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...