Sciweavers

6142 search results - page 185 / 1229
» The Complexity of Partition Functions
Sort
View
107
Voted
DAC
2009
ACM
16 years 4 months ago
Non-intrusive dynamic application profiling for multitasked applications
Application profiling ? the process of monitoring an application to determine the frequency of execution within specific regions ? is an essential step within the design process f...
Karthik Shankar, Roman L. Lysecky
IDEAS
2003
IEEE
86views Database» more  IDEAS 2003»
15 years 8 months ago
A Medium Complexity Discrete Model for Uncertain Spatial Data
This paper presents a method for representing uncertainty in spatial data in a database. The model presented requires moderate amounts of storage space. To compute the probability...
Erlend Tøssebro, Mads Nygård
ICANN
2001
Springer
15 years 8 months ago
Extracting Slow Subspaces from Natural Videos Leads to Complex Cells
Natural videos obtained from a camera mounted on a cat’s head are used as stimuli for a network of subspace energy detectors. The network is trained by gradient ascent on an obje...
Christoph Kayser, Wolfgang Einhäuser, Olaf D&...
98
Voted
AAAI
1998
15 years 4 months ago
Managing Multiple Tasks in Complex, Dynamic Environments
Sketchy planners are designed to achieve goals in realistically complex, time-pressured, and uncertain task environments. However, the ability to manage multiple, potentially inte...
Michael Freed
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...