Sciweavers

2485 search results - page 305 / 497
» Time Bounded Frequency Computations
Sort
View
AAAI
2012
11 years 10 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
ICALP
2009
Springer
14 years 8 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
RECOMB
2007
Springer
14 years 8 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
ICCAD
2003
IEEE
221views Hardware» more  ICCAD 2003»
14 years 5 months ago
Combined Dynamic Voltage Scaling and Adaptive Body Biasing for Heterogeneous Distributed Real-time Embedded Systems
Abstract— Dynamic voltage scaling (DVS) is a powerful technique for reducing dynamic power consumption in a computing system. However, as technology feature size continues to sca...
Le Yan, Jiong Luo, Niraj K. Jha
CVPR
2006
IEEE
13 years 12 months ago
Multiple Face Model of Hybrid Fourier Feature for Large Face Image Set
The face recognition system based on the only single classifier considering the restricted information can not guarantee the generality and superiority of performances in a real s...
Wonjun Hwang, Gyu-tae Park, Jong Ha Lee, Seok-Cheo...