5964 search results - page 138 / 1193 » A theory of speculative computation |
155
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Abstract. Given the projection of a su cient numberof points it is possible to algebraically eliminate the camera parameters and obtain viewinvariant functions of image coordinates...
179
click to vote
PODS
2003
ACM
16 years 7 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
193
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
172
click to vote
ISCC
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
233
click to vote
AIMS
2008
Springer
16 years 1 months ago
2008
Springer
We explore how fixed-point operators can be designed to interact and be composed to form autonomic control mechanisms. We depart from the idea that an operator is idempotent only ...