Sciweavers

3223 search results - page 208 / 645
» The Scaling of Search Cost
Sort
View
RTSS
2008
IEEE
16 years 29 days ago
Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks
—Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, none of current priority assignment pol...
Zheng Shi, Alan Burns
SIBGRAPI
2005
IEEE
16 years 4 days ago
A Linear Algorithm for Exact Pattern Matching in Planar Subdivisions
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
Pedro Ribeiro de Andrade Neto, André Luiz P...
CIARP
2003
Springer
15 years 11 months ago
Fast Handwritten Recognition Using Continuous Distance Transformation
The Continuous Distance Transformation (CDT) used in conjunction with a k-NN classifier has been shown to provide good results in the task of handwriting recognition [1]. Unfortun...
Joaquim Arlandis, Juan Carlos Pérez-Cortes
AUSAI
2007
Springer
15 years 10 months ago
Weight Redistribution for Unweighted MAX-SAT
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar
ERCIMDL
2006
Springer
139views Education» more  ERCIMDL 2006»
15 years 10 months ago
A Peer-to-Peer Architecture for Information Retrieval Across Digital Library Collections
Peer-to-peer networks have been identified as promising architectural concept for developing search scenarios across digital library collections. Digital libraries typically offer ...
Ivana Podnar, Toan Luu, Martin Rajman, Fabius Klem...