4112 search results - page 51 / 823 » Efficient Algorithms for the Spoonerism Problem |
253
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
119
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
124
click to vote
CCR
2008
15 years 3 months ago
2008
Knowledge of the largest traffic flows in a network is important for many network management applications. The problem of finding these flows is known as the heavy-hitter problem ...
120
Voted
MVA
1998
15 years 5 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
144
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...