2485 search results - page 164 / 497 » Time Bounded Frequency Computations |
172
click to vote
MEMOCODE
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
158
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
153
click to vote
IVC
2000
15 years 6 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
174
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
183
click to vote
ASIACRYPT
2009
Springer
16 years 25 days ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...