Sciweavers

1640 search results - page 328 / 328
» Conditional Independence Trees
Sort
View
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
11 years 7 months ago
Lane decoupling for improving the timing-error resiliency of wide-SIMD architectures
A significant portion of the energy dissipated in modern integrated circuits is consumed by the overhead associated with timing guardbands that ensure reliable execution. Timing ...
Evgeni Krimer, Patrick Chiang, Mattan Erez
SDM
2012
SIAM
216views Data Mining» more  SDM 2012»
11 years 7 months ago
Feature Selection "Tomography" - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable
:  Feature Selection “Tomography” - Illustrating that Optimal Feature Filtering is Hopelessly Ungeneralizable George Forman HP Laboratories HPL-2010-19R1 Feature selection; ...
George Forman
ICALP
2009
Springer
14 years 5 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
14 years 5 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
COMGEO
2011
ACM
13 years 10 days ago
Improved bounds for cops-and-robber pursuit
We prove that n cops can capture (that is, some cop can get less than unit distance from) a robber in a continuous square region with side length less than √ 5n and hence that n/...
Laurent Alonso, Edward M. Reingold