Sciweavers

270 search results - page 47 / 54
» Properties of Almost All Graphs and Generalized Quantifiers
Sort
View
PODC
2004
ACM
14 years 1 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
IPPS
2003
IEEE
14 years 1 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
CIKM
2009
Springer
14 years 1 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
LPNMR
1997
Springer
14 years 17 days ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds
IMC
2010
ACM
13 years 6 months ago
Measurement of loss pairs in network paths
Loss-pair measurement was proposed a decade ago for discovering network path properties, such as a router's buffer size. A packet pair is regarded as a loss pair if exactly o...
Edmond W. W. Chan, Xiapu Luo, Weichao Li, Waiting ...