4850 search results - page 359 / 970 » Approximate Data Structures with Applications |
222
click to vote
DSOM
1999
Springer
15 years 11 months ago
1999
Springer
The backup of large data sets is preferably performed automatically outside of regular working hours. In highly structured computer networks, however, faults and exceptions may rel...
196
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
Many compute-intensive applications generate single result values by accessing clusters of nearby points in grids of one, two, or more dimensions. Often, the performance of FGPA i...
182
click to vote
AAAI
2007
15 years 9 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
200
click to vote
CASES
2008
ACM
15 years 8 months ago
2008
ACM
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
175
click to vote
VCIP
2003
15 years 8 months ago
2003
In this paper, we proposed a content-based multimedia analysis/retrieval system basing mainly on the MPEG-7 defined features. Some new and specific features are also included for ...