6110 search results - page 247 / 1222 » Approximate Computing |
148
click to vote
FOSSACS
2007
Springer
16 years 22 days ago
2007
Springer
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
155
click to vote
ADC
2006
Springer
16 years 17 days ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...
171
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
168
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
199
click to vote
PCM
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...