6110 search results - page 440 / 1222 » Approximate Computing |
146
click to vote
ISMIS
2005
Springer
16 years 11 days ago
2005
Springer
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
190
click to vote
ISAAC
2001
Springer
15 years 11 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
196
click to vote
RTCSA
2000
IEEE
15 years 11 months ago
2000
IEEE
As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences ...
161
click to vote
CAAN
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Helsgaun has introduced and implemented the lower tolerances (-values) for an approximation of Held-Karp's 1-tree with the purpose to improve the Lin-Kernighan Heuri...
167
click to vote
ESWS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...