Sciweavers

3082 search results - page 305 / 617
» New Bounds for the Controller Problem
Sort
View
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 6 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
159
Voted
JDA
2007
83views more  JDA 2007»
15 years 6 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
ICASSP
2011
IEEE
14 years 10 months ago
A space time array processing for passive geolocalization of radio transmitters
The problem of passive localization is commonly solved by independently measuring intermediate parameters (such as angles of arrival (AOA), times of arrival (TOA)...) on several m...
Jonathan Bosse, Anne Ferréol, Pascal Larzab...
ICCV
2009
IEEE
16 years 11 months ago
Multimodal Partial Estimates Fusion
Fusing partial estimates is a critical and common problem in many computer vision tasks such as part-based detection and tracking. It generally becomes complicated and intractab...
Jiang Xu, Junsong Yuan, YingWu
LATIN
2004
Springer
16 years 1 days ago
An Improved Data Stream Summary: The Count-Min Sketch and Its Applications
We introduce a new sublinear space data structure—the Count-Min Sketch— for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such a...
Graham Cormode, S. Muthukrishnan