Sciweavers

16257 search results - page 145 / 3252
» D-finiteness: algorithms and applications
Sort
View
CONTEXT
2003
Springer
15 years 11 months ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...
ICIP
2005
IEEE
16 years 8 months ago
Off-line multiple object tracking using candidate selection and the Viterbi algorithm
This paper presents a probabilistic framework for off-line multiple object tracking. At each timestep, a small set of deterministic candidates is generated which is guaranteed to ...
Anil C. Kokaram, François Pitié, Roz...
IBPRIA
2003
Springer
15 years 11 months ago
A Quadtree-Based Unsupervised Segmentation Algorithm for Fruit Visual Inspection
Many segmentation techniques are available in the literature and some of them have been widely used in different application problems. Most of these segmentation techniques were mo...
Adolfo Martínez Usó
ICCS
2009
Springer
15 years 11 months ago
Performance Evaluation of Collective Write Algorithms in MPI I/O
MPI is the de-facto standard for message passing in parallel scientific applications. MPI-IO is a part of the MPI-2 specification defining file I/O operations in the MPI world....
Mohamad Chaarawi, Suneet Chandok, Edgar Gabriel