Tiling Periodicity Yury Lifshits joint work with Juhani Karhum¨aki Steklov Institute of Mathematics, St.Petersburg, Russia [removed]

Source URL: yury.name

• Russian Academy of Sciences
• Steklov Institute of Mathematics
• Tessellation
• Science and technology in Russia
• Periodic function
• Mathematical analysis
• Mathematics
• Fourier analysis

Estimation of the Click Volume by Large Scale Regression Analysis Yury Lifshits1 and Dirk Nowotka2 1 Steklov Institute of Mathematics St.Petersburg, Russia, [removed]

Source URL: yury.name

• Linear regression
• K-nearest neighbor algorithm
• Logistic regression
• Dimensional analysis
• Statistics
• Regression analysis
• Econometrics

The Architecture of the Web Yury Lifshits Caltech http://yury.name Caltech IST Bunch Lunch May 2008

Source URL: yury.name

• Technical communication
• HTML
• World Wide Web
• XHTML
• Hyperlink
• XML
• W3
• Semantic Web
• XHTML+RDFa
• Computing
• Markup languages
• Web standards

Business-Consumer Networks Concept and Challenges Yury Lifshits Caltech

Source URL: yury.name

• Email
• New media
• Mobile phone
• Technology
• Digital media
• Electronics

Алгоритмы и анализ трудоемкости обработки сжатых текстов Лифшиц Юрий Михайлович http://logic.pdmi.ras.ru/˜yura диссертация по специ

Source URL: yury.name

Processing Compressed Texts: A Tractability Border Yury Lifshits Steklov Institute of Mathematics at St.Petersburg http://logic.pdmi.ras.ru/~yura

Source URL: yury.name

• Pattern matching
• Data compression
• Compressed pattern matching
• Computer data

Window Subsequence Matching Window Subsequence Problems for Compressed Texts INPUT: Text: C O M P U T E R

Source URL: yury.name

• Dynamic programming
• Combinatorics
• Mathematical optimization
• Logicians
• Yuri Matiyasevich
• Compressed pattern matching
• Longest common subsequence problem
• Substring
• X Window System
• Mathematics
• Software
• Theoretical computer science

Open Problems TO GO Yury Lifshits Caltech http://yury.name MIT, 30 November 2007

Source URL: yury.name

• Complexity classes
• NP-complete problems
• NP
• Graph
• Mathematical optimization
• Graph coloring
• NP-complete
• Hamiltonian path
• Theoretical computer science
• Graph theory
• Computational complexity theory

Novel Approaches to Nearest Neighbors Random Walks. SEARCH Class. Yury Lifshits http://yury.name Steklov Institute of Mathematics at St.Petersburg

Source URL: yury.name

• Information retrieval
• K-nearest neighbor algorithm
• Nearest neighbor search
• Honda P series
• APT
• Information science
• Search algorithms
• Artificial intelligence