2376 search results - page 220 / 476 » More Efficient Internal-Regret-Minimizing Algorithms |
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
We study the expressiveness and performance of full-text search languages. Our main motivation is to provide a formal basis for comparing such languages and to develop a model for...
ICIAP
2001
Springer
14 years 8 months ago
2001
Springer
Stripes are common sub-structures of text characters, and the scale of these stripes varies little within a word. This scale consistency thus provides us with a useful feature for...
ICFP
2004
ACM
14 years 8 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Many data compression methods cannot remove all redundancy from a file that they compress because it can be encoded to many compressed files. In particular, we consider the redund...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Ye...