11129 search results - page 36 / 2226 » Modeling Search Computing Applications |
120
Voted
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
122
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
137
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
94
Voted
AIPS
2010
15 years 4 months ago
2010
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
107
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...