Sciweavers

715 search results - page 92 / 143
» On graphs with subgraphs having large independence numbers
Sort
View
KDD
2007
ACM
190views Data Mining» more  KDD 2007»
14 years 9 months ago
Model-shared subspace boosting for multi-label classification
Typical approaches to multi-label classification problem require learning an independent classifier for every label from all the examples and features. This can become a computati...
Rong Yan, Jelena Tesic, John R. Smith
AAAI
2010
13 years 10 months ago
Integrating Sample-Based Planning and Model-Based Reinforcement Learning
Recent advancements in model-based reinforcement learning have shown that the dynamics of many structured domains (e.g. DBNs) can be learned with tractable sample complexity, desp...
Thomas J. Walsh, Sergiu Goschin, Michael L. Littma...
ICDM
2006
IEEE
98views Data Mining» more  ICDM 2006»
14 years 2 months ago
What is the Dimension of Your Binary Data?
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency structure of the variables is simpler than the number of variables would sugge...
Nikolaj Tatti, Taneli Mielikäinen, Aristides ...
VLSID
2002
IEEE
105views VLSI» more  VLSID 2002»
14 years 9 months ago
A Heuristic for Clock Selection in High-Level Synthesis
Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. In most synthesis systems, a convenient value of the clock is chosen or...
J. Ramanujam, Sandeep Deshpande, Jinpyo Hong, Mahm...
ICPR
2008
IEEE
14 years 3 months ago
Ranking the local invariant features for the robust visual saliencies
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...
Shengping Xia, Peng Ren, Edwin R. Hancock