Sciweavers

1712 search results - page 174 / 343
» A Computational Approach to Binding Theory
Sort
View
126
Voted
BIRTHDAY
2007
Springer
15 years 5 months ago
Automating Verification of Cooperation, Control, and Design in Traffic Applications
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of c...
Werner Damm, Alfred Mikschl, Jens Oehlerking, Erns...
102
Voted
ECCV
2006
Springer
15 years 5 months ago
An Efficient Method for Tensor Voting Using Steerable Filters
In many image analysis applications there is a need to extract curves in noisy images. To achieve a more robust extraction, one can exploit correlations of oriented features over a...
Erik Franken, Markus van Almsick, Peter Rongen, Lu...
151
Voted
OPODIS
2004
15 years 3 months ago
Embedded Systems - Challenges and Work Directions
Embedded Systems are components integrating software and hardware jointly and specifically designed to provide given functionalities. These components may be used in many different...
Joseph Sifakis
MOBIHOC
2007
ACM
16 years 1 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung
DAC
2005
ACM
16 years 2 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu