Sciweavers

4403 search results - page 351 / 881
» Galois Theory of Algorithms
Sort
View
MFCS
2005
Springer
16 years 8 days ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
SLSFS
2005
Springer
16 years 8 days ago
Discrete Component Analysis
Abstract. This article presents a unified theory for analysis of components in discrete data, and compares the methods with techniques such as independent component analysis, non-...
Wray L. Buntine, Aleks Jakulin
KR
2004
Springer
16 years 4 days ago
Condensed Representations for Inductive Logic Programming
When mining frequent Datalog queries, many queries will be equivalent in the light of an implicit or explicit background knowledge. To alleviate the problem, we introduce various t...
Luc De Raedt, Jan Ramon
NIME
2004
Springer
93views Music» more  NIME 2004»
16 years 4 days ago
On the Choice of Mappings Based On Geometric Properties
The choice of mapping strategies to effectively map controller variables to sound synthesis algorithms is examined. Specifically, we look at continuous mappings that have a geom...
Doug Van Nort, Marcelo M. Wanderley, Philippe Depa...
ECRTS
2003
IEEE
16 years 2 days ago
Resource Sharing in an Enhanced Rate-Based Execution Model
A theory of resource sharing in a mixed system with hard real-time and non-real-time processing requirements is presented. The real-time processing is modeled as rate-based execut...
Xin Liu, Steve Goddard