Sciweavers

436 search results - page 51 / 88
» On two variations of identifying codes
Sort
View
CVPR
2006
IEEE
15 years 4 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
ICIP
2005
IEEE
15 years 3 months ago
Mining arbitrary-length repeated patterns in television broadcast
Mining repeated patterns in television broadcast is important to advertisers in tracking a large number of television commercials. It can also benefit long-term archival of telev...
Sen-Ching S. Cheung, Thinh Nguyen
SIGSOFT
2005
ACM
15 years 3 months ago
Reuse and variability in large software applications
Reuse has always been a major goal in software engineering, since it promises large gains in productivity, quality and time to market reduction. Practical experience has shown tha...
Jacky Estublier, Germán Vega
ICAIL
2003
ACM
15 years 3 months ago
A Comparative Evaluation of Name-Matching Algorithms
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
Karl Branting
ICPADS
1998
IEEE
15 years 2 months ago
One-Phase Commit: Does it make Sense?
1 Although widely used in distributed transactional systems, the so-called Two-Phase Commit (2PC) protocol introduces a substantial delay in transaction processing, even in the abs...
Maha Abdallah, Rachid Guerraoui, Philippe Pucheral