5316 search results - page 339 / 1064 » Which Search Problems Are Random |
180
click to vote
WEA
2007
Springer
16 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
224
click to vote
ML
2006
ACM
15 years 7 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
266
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have t...
211
click to vote
ICNP
2002
IEEE
16 years 8 days ago
2002
IEEE
Abstract— Internet flash crowds (a.k.a. hot spots) are a phenomenon that result from a sudden, unpredicted increase in an on-line object’s popularity. Currently, there is no e...
191
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...