1525 search results - page 65 / 305 » Matching with Regular Constraints |
109
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
154
Voted
ICS
2009
Tsinghua U.
15 years 10 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
186
Voted
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
141
Voted
HIPC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
138
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...