Sciweavers

2124 search results - page 169 / 425
» Repairing Structurally Complex Data
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard

Source Code
1763views
15 years 7 months ago
dlib C++ Library
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
Davis E. King
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
14 years 3 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
14 years 2 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
IPL
2006
103views more  IPL 2006»
13 years 10 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen