2080 search results - page 396 / 416 » Measuring empirical computational complexity |
118
click to vote
SAC
2006
ACM
15 years 7 months ago
2006
ACM
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
112
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
118
click to vote
SIGIR
2005
ACM
15 years 7 months ago
2005
ACM
We introduce a new model for semantic annotation and retrieval from image databases. The new model is based on a probabilistic formulation that poses annotation and retrieval as c...
103
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
119
click to vote
IPSN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...