350 search results - page 38 / 70 » Lower and upper bounds on obtaining history independence |
162
click to vote
MFCS
2004
Springer
16 years 4 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
175
click to vote
ICALP
2007
Springer
16 years 28 days ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
182
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...
181
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
184
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...