Sciweavers

15073 search results - page 86 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
COLT
2003
Springer
15 years 11 months ago
On Learning to Coordinate: Random Bits Help, Insightful Normal Forms, and Competency Isomorphisms
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 ...
John Case, Sanjay Jain, Franco Montagna, Giulia Si...
ICASSP
2008
IEEE
16 years 19 days ago
Some results on 16-QAM MIMO detection using semidefinite relaxation
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...
Wing-Kin Ma, Chao-Cheng Su, Joakim Jalden, Chong-Y...
IROS
2009
IEEE
261views Robotics» more  IROS 2009»
16 years 25 days ago
Probabilistic motion planning among moving obstacles following typical motion patterns
— 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...
Chiara Fulgenzi, Anne Spalanzani, Christian Laugie...
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 11 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
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...
Shimin Chen, Phillip B. Gibbons, Suman Nath
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 10 days ago
Some novel locality results for the blob code spanning tree representation
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...
Tim Paulden, David K. Smith