Sciweavers

1151 search results - page 229 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
SIGSOFT
2005
ACM
14 years 8 months ago
Facilitating software evolution research with kenyon
Software evolution research inherently has several resourceintensive logistical constraints. Archived project artifacts, such as those found in source code repositories and bug tr...
Jennifer Bevan, E. James Whitehead Jr., Sunghun Ki...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
ECCV
2006
Springer
14 years 9 months ago
Triangulation for Points on Lines
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the p...
Adrien Bartoli, Jean-Thierry Lapresté
FC
2009
Springer
150views Cryptology» more  FC 2009»
14 years 2 months ago
Privacy-Preserving Information Markets for Computing Statistical Data
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...
Aggelos Kiayias, Bülent Yener, Moti Yung