Sciweavers

305 search results - page 35 / 61
» Symmetric Enumeration Reducibility
Sort
View
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 11 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 10 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
ICNP
2009
IEEE
14 years 4 months ago
Better by a HAIR: Hardware-Amenable Internet Routing
—Routing protocols are implemented in the form of software running on a general-purpose microprocessor. However, conventional software-based router architectures face significan...
Firat Kiyak, Brent Mochizuki, Eric Keller, Matthew...
CIE
2009
Springer
14 years 4 months ago
Equivalence Relations on Classes of Computable Structures
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
Ekaterina B. Fokina, Sy-David Friedman
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
14 years 4 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz