Sciweavers

736 search results - page 97 / 148
» High-order functions and their ordering relations
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
16 years 7 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ISESE
2002
IEEE
15 years 11 months ago
Elimination of Crucial Faults by a New Selective Testing Method
Recent software systems contain a lot of functions to provide various services. According to this tendency, software testing becomes more difficult than before and cost of testing...
Masayuki Hirayama, Tetsuya Yamamoto, Jiro Okayasu,...
ICISC
1998
110views Cryptology» more  ICISC 1998»
15 years 7 months ago
The nonhomomorphicity of S-boxes
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
Yuliang Zheng, Xian-Mo Zhang
ESSLLI
1999
Springer
15 years 10 months ago
Towards Discontinuous Grammar
This paper presents a grammar formalism in which constituent graphs are unions of a continuous surface tree and a discontinuous deep tree. The formalism has an object-oriented desi...
Matthias T. Kromann
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
16 years 7 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...