Sciweavers

4335 search results - page 791 / 867
» Privatizing Constraint Optimization
Sort
View
WWW
2002
ACM
14 years 12 months ago
Learning to map between ontologies on the semantic web
Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated info...
AnHai Doan, Jayant Madhavan, Pedro Domingos, Alon ...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 11 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 11 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
MOBIHOC
2008
ACM
14 years 10 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei
ICCAD
2007
IEEE
118views Hardware» more  ICCAD 2007»
14 years 8 months ago
Timing variation-aware high-level synthesis
—This work proposes a new yield computation technique dedicated to HLS, which is an essential component in timing variationaware HLS research field. The SSTAs used by the curren...
Jongyoon Jung, Taewhan Kim