Sciweavers

161 search results - page 6 / 33
» Counting Distinct Strings
Sort
View
JCSS
2008
62views more  JCSS 2008»
13 years 8 months ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
14 years 2 months ago
No Double Counting Semantics for Conditional Independence
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
Prakash P. Shenoy
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 8 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
JC
2008
77views more  JC 2008»
13 years 8 months ago
A numerical algorithm for zero counting, I: Complexity and accuracy
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...
Felipe Cucker, Teresa Krick, Gregorio Malajovich, ...
INFOCOM
2010
IEEE
13 years 6 months ago
Counting RFID Tags Efficiently and Anonymously
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem...
Hao Han, Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhe...