13 search results - page 2 / 3 » Three alternative combinatorial formulations of the theory o... |
CIKM
2007
Springer
13 years 11 months ago
2007
Springer
Implicit feedback algorithms utilize interaction between searchers and search systems to learn more about users’ needs and interests than expressed in query statements alone. Th...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
WCET
2010
13 years 2 months ago
2010
The assumption of task independence has long been consubstantial with the formulation of many schedulability analysis techniques. That assumption is evidently advantageous for the...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...