Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy se...
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
—The Internet host cardinality, defined as the number of distinct peers that an Internet host communicates with, is an important metric for profiling Internet hosts. Some examp...
Jing Cao, Yu Jin, Aiyou Chen, Tian Bu, Zhi-Li Zhan...
Counting or estimating the number of tags is crucial for large-scale RFID systems. The use of multiple readers was recently proposed to improve the efficiency and effectiveness in ...