Sciweavers

697 search results - page 83 / 140
» On the Theory of Average Case Complexity
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
14 years 8 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
ISSAC
2009
Springer
139views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Multihomogeneous resultant formulae for systems with scaled support
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
Ioannis Z. Emiris, Angelos Mantzaflaris
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
14 years 2 months ago
Optimal sensor hop selection: Sensor energy minimization and network lifetime maximization with guaranteed system performance
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
ECIS
2000
13 years 9 months ago
Linking Knowledge Management and Innovation
There has been an explosion of interest in Knowledge Management [KM] theory and practice. However, it is argued here that much of this work fails to consider the purpose for which...
Jacky Swan, Sue Newell