Sciweavers

837 search results - page 82 / 168
» Hard combinators
Sort
View
JUCS
2006
83views more  JUCS 2006»
14 years 12 months ago
Ridge Orientation Estimation and Verification Algorithm for Fingerprint Enhancement
: Fingerprint image enhancement is a common and critical step in fingerprint recognition systems. To enhance the images, most of the existing enhancement algorithms use filtering t...
Li-min Liu, Tian-Shyr Dai
PC
2006
103views Management» more  PC 2006»
14 years 11 months ago
Parallel skeletons for manipulating general trees
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
SIGCSE
2008
ACM
141views Education» more  SIGCSE 2008»
14 years 11 months ago
Broadening participation through scalable game design
Game development is quickly gaining popularity in introductory programming courses. Motivational and educational aspects of game development are hard to balance and often sacrific...
Alexander Repenning, Andri Ioannidou
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
TKDE
2008
126views more  TKDE 2008»
14 years 11 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...