MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Yury Lifshits" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 10 documents found, showing 1 through 10.
ATOM RSS
  • Mathematical Challenge  
  • by Yury Lifshits
  • …Want to store date in the smallest possible space? Use data compression!…
  • Add To MetaCart
  • Processing compressed texts: a tractability border  
  • by Yury Lifshits — 2007 — Proc. CPM 2007
  • …Abstract. What kind of operations can we perform effectively (without full unpacking) with compressed texts? In this paper we consider three fundamental problems: (1) check the equality of two compressed texts, (2) check whether one compressed text is a substring of another compressed text, and (3) …
  • Cited by 2 (1 self) – Add To MetaCart
  • Similarity search via combinatorial nets  
  • by Yury Lifshits, Shengyu Zhang
  • …We consider Nearest Neighbor Search problem in the so called combinatorial framework: Only direct comparisons between two pairwise similarity values are allowed. We assume that the similarity order for the input dataset has the following consistency property: if x is the a’th most similar object to …
  • Cited by 1 (0 self) – Add To MetaCart
  • Querying and Embedding Compressed Texts  
  • by Yury Lifshits, Markus Lohrey — 2005
  • …Abstract. In this work the computational complexity of two simple string problems on compressed input strings is considered: the querying problem (What is the symbol at a given position in a given input string?) and the embedding problem (Can the first input string embedded into the second input str…
  • Cited by 2 (1 self) – Add To MetaCart
  • Estimation of the click volume by large scale regression analysis  
  • by Yury Lifshits, Dirk Nowotka — 2007 — In CSR’07
  • …Abstract. How could one estimate the total number of clicks a new advertisement could potentially receive in the current market? This question, called the click volume estimation problem is investigated in this paper. This constitutes a new research direction for advertising engines. We propose a mo…
  • Cited by 3 (2 self) – Add To MetaCart
  • Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions ⋆  
  • by Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-ukelson
  • …Abstract. We present a method to speed up the dynamic program algorithms used for solving the HMM decoding and training problems for discrete time-independent HMMs. We discuss the application of our method to Viterbi’s decoding and training algorithms [33], as well as to the forward-backward and Bau…
  • Cited by 1 (1 self) – Add To MetaCart
  • Maximal intersection queries in randomized graph models  
  • by Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka — 2007 — In CSR’07
  • …Abstract. Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time constraints on the query and on a possible preprocessing of the set family make this problem challenging. Such maxi…
  • Cited by 3 (2 self) – Add To MetaCart
  • Maximal Intersection Queries in Randomized Input Models  
  • by Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
  • …Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constraints on the query and on a possible preprocessing of the set family make this problem challenging. Such maximal intersect…
  • Add To MetaCart
Help! Showing 1 through 10.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB