Sciweavers

432 search results - page 32 / 87
» Open Problems with Part-Whole Relations
Sort
View
100
Voted
ENTCS
2010
96views more  ENTCS 2010»
14 years 9 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen
84
Voted
CDC
2010
IEEE
14 years 7 months ago
Preference elicitation in Fully Probabilistic Design of decision strategies
Any systematic decision-making design selects a decision strategy that makes the resulting closed-loop behaviour close to the desired one. Fully Probabilistic Design (FPD) describe...
Miroslav Kárný, Tatiana V. Guy
SIAMCOMP
2011
14 years 7 months ago
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Avraham Ben-Aroya, Amnon Ta-Shma
105
Voted
TSP
2010
14 years 7 months ago
Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar
Detection and estimation problems in multiple-input multiple-output (MIMO) radar have recently drawn considerable interest in the signal processing community. Radar has long been a...
Dimitri Nion, Nicholas D. Sidiropoulos
90
Voted
ICALP
2005
Springer
15 years 6 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...