Sciweavers

8933 search results - page 111 / 1787
» Usability over time
Sort
View
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 9 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
AMAI
2002
Springer
15 years 5 months ago
Modeling Moving Objects over Multiple Granularities
This paper introduces a framework for modeling the movement of objects or individuals over multiple granularities. Granularity refers to selecting the appropriate level of detail ...
Kathleen Hornsby, Max J. Egenhofer
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 5 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2008
ACM
113views Database» more  EDBT 2008»
16 years 5 months ago
Ensuring correctness over untrusted private database
In this paper we address the problem of ensuring the correctness of query results returned by an untrusted private database. The database owns the data and may modify it at any ti...
Sarvjeet Singh, Sunil Prabhakar
DCC
2008
IEEE
16 years 5 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev