Sciweavers

4041 search results - page 246 / 809
» time 2009
Sort
View
ICALP
2009
Springer
16 years 7 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
ICASSP
2009
IEEE
16 years 1 months ago
Identification of neurons participating in cell assemblies
Chances to detect assembly activity are expected to increase if the spiking activities of large numbers of neurons are recorded simultaneously. Although such massively parallel re...
Sonja Grün, Denise Berger, Christian Borgelt
IDA
2009
Springer
16 years 1 months ago
Selecting Computer Architectures by Means of Control-Flow-Graph Mining
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
Frank Eichinger, Klemens Böhm
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
16 years 1 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
CDC
2009
IEEE
129views Control Systems» more  CDC 2009»
15 years 11 months ago
Resource allocation for signal detection with active sensors
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...