Sciweavers

3396 search results - page 524 / 680
» Tree representations of graphs
Sort
View
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
15 years 11 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
144
Voted
SENSYS
2006
ACM
15 years 11 months ago
Scalable data aggregation for dynamic events in sensor networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
Kai-Wei Fan, Sha Liu, Prasun Sinha
NLP
2000
15 years 8 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
161
Voted
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 5 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
BMCBI
2007
102views more  BMCBI 2007»
15 years 5 months ago
Understanding and using the meaning of statements in a bio-ontology: recasting the Gene Ontology in OWL
The bio-ontology community falls into two camps: first we have biology domain experts, who actually hold the knowledge we wish to capture in ontologies; second, we have ontology s...
Mikel Egaña Aranguren, Sean Bechhofer, Phil...