1941 search results - page 279 / 389 » On the Hardness of Approximate Reasoning |
168
Voted
AIRS
2004
Springer
16 years 12 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
187
click to vote
GC
2004
Springer
16 years 11 days ago
2004
Springer
Abstract. Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is ...
190
click to vote
LPAR
2004
Springer
16 years 10 days ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
188
click to vote
ECCV
2010
Springer
16 years 10 days ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
167
click to vote
DATE
2003
IEEE
16 years 8 days ago
2003
IEEE
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...