Sciweavers

1331 search results - page 73 / 267
» Complexity bounds for zero-test algorithms
Sort
View
FOCS
2009
IEEE
15 years 9 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
134
Voted
JAIR
2002
134views more  JAIR 2002»
15 years 2 months ago
Specific-to-General Learning for Temporal Events with Application to Learning Event Definitions from Video
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
Alan Fern, Robert Givan, Jeffrey Mark Siskind
102
Voted
DLOG
2007
15 years 4 months ago
Inverse Roles Make Conjunctive Queries Hard
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
Carsten Lutz
122
Voted
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 4 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
134
Voted
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
15 years 8 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson