Sciweavers

1243 search results - page 113 / 249
» Complexity reduction of C-Algorithm
Sort
View
AAAI
2008
15 years 3 months ago
Active Learning for Pipeline Models
For many machine learning solutions to complex applications, there are significant performance advantages to decomposing the overall task into several simpler sequential stages, c...
Dan Roth, Kevin Small
AIPS
2004
15 years 2 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
DCC
2008
IEEE
15 years 1 months ago
Coding Overcomplete Representations of Audio Using the MCLT
We propose a system for audio coding using the modulated complex lapped transform (MCLT). In general, it is difficult to encode signals using overcomplete representations without ...
Byung-Jun Yoon, Henrique S. Malvar
ENTCS
2006
103views more  ENTCS 2006»
15 years 1 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
LOBJET
2002
321views more  LOBJET 2002»
15 years 1 months ago
Understanding software evolution using a combination of software visualization and software metrics
Coping with huge amounts of data is one of the major problems in the context of software evolution. Current approaches reduce this complexity by filtering out irrelevant informatio...
Michele Lanza, Stéphane Ducasse