Sciweavers

2485 search results - page 440 / 497
» Time Bounded Frequency Computations
Sort
View
IJFCS
2008
158views more  IJFCS 2008»
13 years 7 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
IPL
2006
89views more  IPL 2006»
13 years 7 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
JOC
2008
92views more  JOC 2008»
13 years 7 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini