Sciweavers

304 search results - page 11 / 61
» Solving Generalized Small Inverse Problems
Sort
View
CLASSIFICATION
2008
111views more  CLASSIFICATION 2008»
13 years 7 months ago
Probabilistic D-Clustering
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
Adi Ben-Israel, Cem Iyigun
PODS
2007
ACM
142views Database» more  PODS 2007»
14 years 7 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
ISW
2010
Springer
13 years 5 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
FOCM
2010
108views more  FOCM 2010»
13 years 6 months ago
Iterative Thresholding Meets Free-Discontinuity Problems
Free-discontinuity problems describe situations where the solution of interest is defined by a function and a lower dimensional set consisting of the discontinuities of the funct...
Massimo Fornasier, Rachel Ward
AVI
2006
13 years 9 months ago
Usability of overview-supported zooming on small screens with regard to individual differences in spatial ability
While zoomable user interfaces can improve the usability of applications by easing data access, a drawback is that some users tend to become lost after they have zoomed in. Previo...
Thorsten Büring, Jens Gerken, Harald Reiterer