Sciweavers

32 search results - page 4 / 7
» Interval completion with few edges
Sort
View
CRYPTO
2012
Springer
268views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Secret Sharing Schemes for Very Dense Graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Amos Beimel, Oriol Farràs, Yuval Mintz
IPAS
2007
13 years 10 months ago
Color filter array interpolation based on spatial adaptivity
Conventional approach in single-chip digital cameras is a use of color lter arrays (CFA) in order to sample di erent spectral components. Demosaicing algorithms interpolate these ...
Dmitriy Paliy, Radu Ciprian Bilcu, Vladimir Katkov...
HIS
2003
13 years 9 months ago
A Hybrid Approach for Learning Parameters of Probabilistic Networks from Incomplete Databases
– Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learni...
S. Haider
SIAMMAX
2010
116views more  SIAMMAX 2010»
13 years 2 months ago
Acquired Clustering Properties and Solution of Certain Saddle Point Systems
Many mathematical models involve flow equations characterized by nonconstant viscosity, and a Stokes type problem with variable viscosity coefficient arises. Appropriate block diag...
M. A. Olshanskii, V. Simoncini
SSD
2001
Springer
128views Database» more  SSD 2001»
13 years 12 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting