15073 search results - page 86 / 3015 » Probabilistic algorithms for computing resultants |
94
Voted
COLT
2003
Springer
15 years 8 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
102
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
Semidefinite relaxation (SDR) is a high-performance efficient approach to MIMO detection especially for the BPSK or QPSK constellations. Recently, a number of research endeavors...
134
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— The paper presents a navigation algorithm for dynamic, uncertain environment. The static environment is unknown, while moving pedestrians are detected and tracked on-line. Pede...
137
click to vote
SIGMOD
2010
ACM
15 years 8 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
130
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...