14515 search results - page 149 / 2903 » Efficient Embedded Computing |
161
click to vote
COMGEO
2006
ACM
15 years 2 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
SIGMOD
2001
ACM
16 years 2 months ago
2001
ACM
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
105
Voted
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
118
click to vote
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
119
Voted
CRYPTO
2008
Springer
15 years 4 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...