Sciweavers

9176 search results - page 311 / 1836
» algorithms 2010
Sort
View
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 4 months ago
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Let f1, f2, f3 : Fn 2 {0, 1} be three Boolean functions. We say a triple (x, y, x + y) is a triangle in
Arnab Bhattacharyya, Ning Xie
ALT
2010
Springer
15 years 8 months ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
ECCC
2010
143views more  ECCC 2010»
15 years 4 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
15 years 6 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
Gerth Stølting Brodal, Pooya Davoodi, S. Sr...
ICASSP
2010
IEEE
15 years 6 months ago
Multiple Selection Approximation for improved spatio-temporal prediction in video coding
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
Jürgen Seiler, André Kaup