Sciweavers

450 search results - page 66 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 11 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
CLA
2004
13 years 11 months ago
Planarity of Additively Drawn Concept Lattices
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
Christian Zschalig
TSP
2008
150views more  TSP 2008»
13 years 9 months ago
Local Vote Decision Fusion for Target Detection in Wireless Sensor Networks
This study examines the problem of target detection by a wireless sensor network. Sensors acquire measurements emitted from the target that are corrupted by noise and initially ma...
Natallia Katenka, Elizaveta Levina, George Michail...
ICTAC
2010
Springer
13 years 7 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 10 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans