2623 search results - page 453 / 525 » Universal Learning Theory |
117
click to vote
COCO
2004
Springer
15 years 4 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
104
Voted
ISER
1995
Springer
15 years 4 months ago
1995
Springer
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
89
Voted
CCS
2008
ACM
15 years 2 months ago
2008
ACM
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
94
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
130
click to vote
ISLPED
2007
ACM
15 years 2 months ago
2007
ACM
We analyze the effect of thermal constraints on the performance and power of multi-core processors. We propose system-level power and thermal models, and derive expressions for (a...