Sciweavers

5799 search results - page 679 / 1160
» Position Paper
Sort
View
ICLP
2003
Springer
16 years 3 days ago
Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
Frank D. Valencia
CLUSTER
2007
IEEE
15 years 11 months ago
A feasibility analysis of power-awareness and energy minimization in modern interconnects for high-performance computing
High-performance computing (HPC) systems consume a significant amount of power, resulting in high operational costs, reduced reliability, and wasting of natural resources. Therefor...
Reza Zamani, Ahmad Afsahi, Ying Qian, V. Carl Hama...
MVA
1996
100views Computer Vision» more  MVA 1996»
15 years 8 months ago
A Support System for the Visually Disabled to Recognize 3D Objects
We have been developing a support system for the visually disabled t,o actively recognize threedimensional objects or environments, an application system of 3D computer vision. Th...
Yoshihiro Kawai, Fumiaki Tomita
170
Voted
CLEF
2009
Springer
15 years 8 months ago
Unsupervised Word Decomposition with the Promodes Algorithm
We present Promodes, an algorithm for unsupervised word decomposition, which is based on a probabilistic generative model. The model considers segment boundaries as hidden variable...
Sebastian Spiegler, Bruno Golénia, Peter A....
CADE
2005
Springer
16 years 7 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna