4218 search results - page 374 / 844 » Complete sets of cooperations |
219
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
193
click to vote
PSD
2004
Springer
16 years 28 days ago
2004
Springer
Abstract. Masking methods protect data sets against disclosure by perturbing the original values before publication. Masking causes some information loss (masked data are not exact...
175
click to vote
SC
2000
ACM
15 years 12 months ago
2000
ACM
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...
198
click to vote
3DIM
1997
IEEE
15 years 11 months ago
1997
IEEE
In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple tex...
207
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...