Sciweavers

409 search results - page 9 / 82
» Matching Scenarios with Timing Constraints
Sort
View
KDD
2008
ACM
175views Data Mining» more  KDD 2008»
14 years 8 months ago
Geocode Matching and Privacy Preservation
Geocoding is the process of matching addresses to geographic locations, such as latitudes and longitudes, or local census areas. In many applications, addresses are the key to geo-...
Peter Christen
PEPM
1994
ACM
13 years 11 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder
ICLP
2010
Springer
13 years 11 months ago
Structured Interactive Musical Scores
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...
Mauricio Toro-Bermudez
CVPR
2005
IEEE
14 years 9 months ago
Accurate and Efficient Stereo Processing by Semi-Global Matching and Mutual Information
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
Heiko Hirschmüller
FGCN
2007
IEEE
14 years 1 months ago
Supporting Deadline Monotonic Policy over 802.11 MAC Layer Service Time Distribution
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...