Sciweavers

2880 search results - page 463 / 576
» Types are calling conventions
Sort
View
JUCS
2002
123views more  JUCS 2002»
15 years 6 months ago
Synchronization and Stability of Finite Automata
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
Jarkko Kari
TPDS
2002
126views more  TPDS 2002»
15 years 6 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
IEE
2008
117views more  IEE 2008»
15 years 5 months ago
Formal verification of systems with an unlimited number of components
1 2 3 In many real component-based systems and patterns of component interaction, there can be identified a stable part (like control component, server, instance handler) and a nu...
Pavlína Vareková, Barbora Zimmerova,...
PRL
2007
101views more  PRL 2007»
15 years 5 months ago
Accuracy versus speed in context-based object detection
The visual detection and recognition of objects is facilitated by context. This paper studies two types of learning methods for realizing context-based object detection in paintin...
Niek Bergboer, Eric O. Postma, H. Jaap van den Her...
DEXA
2010
Springer
226views Database» more  DEXA 2010»
15 years 5 months ago
Vi-DIFF: Understanding Web Pages Changes
Nowadays, many applications are interested in detecting and discovering changes on the web to help users to understand page updates and more generally, the web dynamics. Web archiv...
Zeynep Pehlivan, Myriam Ben Saad, Stéphane ...