Sciweavers

302 search results - page 48 / 61
» A Comparison of Upper Ontologies
Sort
View
CCCG
2008
13 years 9 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
TREC
1998
13 years 9 months ago
ClickIR: Text Retrieval using a Dynamic Hypertext Interface
In this report we describe our model of dynamic hypertext and how the ClickIR system uses this model to assist users in interactive search. The system was used in both the ad hoc ...
Richard C. Bodner, Mark H. Chignell
COMGEO
2008
ACM
13 years 8 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
CN
2006
75views more  CN 2006»
13 years 8 months ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
JOC
2008
92views more  JOC 2008»
13 years 8 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