1191 search results - page 161 / 239 » Completeness and Performance Of The APO Algorithm |
CIKM
2007
Springer
15 years 4 months ago
2007
Springer
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
ASWC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Developing ontologies is not an easy task and often the resulting ontologies are not consistent or complete. Such ontologies, although often useful, also lead to problems...
101
click to vote
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Large scale compute clusters continue to grow to ever-increasing proportions. However, as clusters and applications continue to grow, the Mean Time Between Failures (MTBF) has redu...
120
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Abstract--Intentional interference constitutes a major threat for communication networks operating over a shared medium where availability is imperative. Jamming attacks are often ...