11740 search results - page 311 / 2348 » More Problems in Rewriting |
169
click to vote
BIBE
2005
IEEE
16 years 9 days ago
2005
IEEE
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
148
click to vote
INFOCOM
2005
IEEE
16 years 8 days ago
2005
IEEE
— In a P2P system, a client peer may select one or more server peers to download a specific file. In a P2P resource economy, the server peers charge the client for the download...
158
click to vote
SIGDOC
2005
ACM
16 years 6 days ago
2005
ACM
Testing of usability could perhaps be more accurately described as testing of learnability. We know more about the problems of novice users than we know of the problems of experie...
187
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
191
click to vote
EMMCVPR
2003
Springer
15 years 12 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...