Sciweavers

2498 search results - page 367 / 500
» Data Structures with Unpredictable Timing
Sort
View
101
Voted
SPAA
1990
ACM
15 years 6 months ago
Parallel Algorithms for Arrangements
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
Richard J. Anderson, Paul Beame, Erik Brisson
120
Voted
CAV
2010
Springer
172views Hardware» more  CAV 2010»
15 years 6 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
119
Voted
ECAI
2004
Springer
15 years 6 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
103
Voted
IFIP
2000
Springer
15 years 6 months ago
Information Systems Conceptual Foundations: Looking Backward and Forward
The academic field of information systems has developed because organizations use a specialized body of knowledge about information and communications systems. Teaching and resear...
Gordon B. Davis
VISUALIZATION
1995
IEEE
15 years 6 months ago
Enhancing Transparent Skin Surfaces with Ridge and Valley Lines
There are many applications that can benefit from the simultaneous display of multiple layers of data. The objective in these cases is to render the layered surfaces in a such way...
Victoria Interrante, Henry Fuchs, Stephen M. Pizer