Sciweavers

5962 search results - page 356 / 1193
» Efficient Clustering for Orders
Sort
View
DLOG
2004
15 years 8 months ago
Efficient Reasoning with Range and Domain Constraints
We show how a tableaux algorithm for SHIQ can be extended to support role boxes that include range and domain axioms, prove that the extended algorithm is still a decision procedur...
Dmitry Tsarkov, Ian Horrocks
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 8 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
WAE
2001
236views Algorithms» more  WAE 2001»
15 years 8 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
Jyrki Katajainen, Bjarke Buur Mortensen
ANLP
2000
96views more  ANLP 2000»
15 years 8 months ago
Efficient parsing strategies for syntactic analysis of closed captions
We present an efficientmulti-levelchart parser that was designed forsyntacticanalysisofclosedcaptions (subtitles) in a real-time Machine Translation (MT) system. In order to achie...
Krzysztof Czuba
ECIR
1998
Springer
15 years 8 months ago
Combining Information Retrieval with Information Extraction for Efficient Retrieval of Calls for Papers
In many domains there are specific attributes in documents that carry more weight than the general words in the document. This paper proposes the use of information extraction tec...
F. Lazarinis