Sciweavers

849 search results - page 75 / 170
» Study of Challenges and Techniques in Large Scale Matching
Sort
View
100
Voted
TCAD
2008
201views more  TCAD 2008»
15 years 14 days ago
Bitmask-Based Code Compression for Embedded Systems
Embedded systems are constrained by the available memory. Code-compression techniques address this issue by reducing the code size of application programs. It is a major challenge ...
Seok-Won Seong, Prabhat Mishra
IEEEPACT
2007
IEEE
15 years 6 months ago
Performance Portable Optimizations for Loops Containing Communication Operations
Effective use of communication networks is critical to the performance and scalability of parallel applications. Partitioned Global Address Space languages like UPC bring the pro...
Costin Iancu, Wei Chen, Katherine A. Yelick
117
Voted
CLEF
2010
Springer
14 years 7 months ago
FastDocode: Finding Approximated Segments of N-Grams for Document Copy Detection - Lab Report for PAN at CLEF 2010
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
Gabriel Oberreuter, Gaston L'Huillier, Sebasti&aac...
116
Voted
CGF
2008
144views more  CGF 2008»
15 years 20 days ago
Deformation-Driven Shape Correspondence
Non-rigid 3D shape correspondence is a fundamental and difficult problem. Most applications which require a correspondence rely on manually selected markers. Without user assistan...
Hao Zhang 0002, Alla Sheffer, Daniel Cohen-Or, Qua...
AAAI
2000
15 years 1 months ago
Dynamic Case Creation and Expansion for Analogical Reasoning
Most CBR systems rely on a fixed library of cases, where each case consists of a set of facts specified in advance. This paper describes techniques for dynamically extracting case...
Thomas Mostek, Kenneth D. Forbus, Cara Meverden