Sciweavers

1857 search results - page 334 / 372
» Minimum Degree Orderings
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
15 years 3 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
CTCS
1989
Springer
15 years 3 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 3 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
DAWAK
2006
Springer
15 years 3 months ago
On the Computation of Maximal-Correlated Cuboids Cells
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
Ronnie Alves, Orlando Belo
FLAIRS
2010
15 years 2 months ago
Using a Graph-Based Approach for Discovering Cybercrime
The ability to mine data represented as a graph has become important in several domains for detecting various structural patterns. One important area of data mining is anomaly det...
William Eberle, Lawrence B. Holder, Jeffrey Graves