6315 search results - page 215 / 1263 » Approximating Solution Structure |
180
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
166
click to vote
ENC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
195
click to vote
AAAI
2008
15 years 9 months ago
2008
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
184
click to vote
ECCV
2008
Springer
15 years 8 months ago
2008
Springer
We analyze the problem of reconstructing a 2D function that approximates a set of desired gradients and a data term. The combined data and gradient terms enable operations like mod...
169
click to vote
ACL
2007
15 years 8 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...