32545 search results - page 396 / 6509 » Data Structures and Algorithms |
190
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
Even if the class label information is unknown, side information represents some equivalence constraints between pairs of patterns, indicating whether pairs originate from the sam...
169
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
A novel algorithm for robustly segmenting changes between different images of a scene is presented. This computationally efficient algorithm is based on a non-linear comparison of...
174
Voted
CPM
2007
Springer
15 years 10 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
171
Voted
CSDA
2006
15 years 6 months ago
2006
A framework of penalized generalized linear models and tensor products of B-splines with roughness penalties allows effective smoothing of data in multidimensional arrays. A strai...
200
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...