Sciweavers

128 search results - page 11 / 26
» Partitioning a weighted partial order
Sort
View
DS
1992
128views Database» more  DS 1992»
13 years 8 months ago
Achieving Incremental Consistency among Autonomous Replicated Databases
In this paper, we present methods for supporting autonomous updates in replicated databases. Autonomous updates are of particular importance to applications that cannot tolerate t...
Stefano Ceri, Maurice A. W. Houtsma, Arthur M. Kel...
EOR
2007
111views more  EOR 2007»
13 years 7 months ago
A pegging approach to the precedence-constrained knapsack problem
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proï...
Byungjun You, Takeo Yamada
ICIAP
2001
Springer
14 years 7 months ago
Clustering Context Properties of Wavelet Coefficients in Automatic Modelling and Image Coding
An algorithm for automatic modelling of wavelet coefficients from context properties is presented. The algorithm is used to implement an image coder, in order to demonstrate its i...
Joonas Lehtinen, Juha Kivijärvi
KAIS
2006
97views more  KAIS 2006»
13 years 7 months ago
Web image indexing by using associated texts
In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated...
Zhiguo Gong, Leong Hou U, Chan Wa Cheang
DGO
2007
133views Education» more  DGO 2007»
13 years 8 months ago
A toolbox for the choice of indicator classes for ranking of watersheds
There has been considerable work on determining a suitable method to accomplish a satisfactory ordering of a group of objects, when there are multiple evaluation criteria. A weigh...
K. Sham Bhat