Sciweavers

3897 search results - page 143 / 780
» complexity 2010
Sort
View
JSC
2010
96views more  JSC 2010»
13 years 8 months ago
On a generalization of Stickelberger's Theorem
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
Peter Scheiblechner
ENTCS
2007
122views more  ENTCS 2007»
13 years 10 months ago
Plugging a Space Leak with an Arrow
The implementation of conceptually continuous signals in functional reactive programming (FRP) is studied in detail. We show that recursive signals in standard implementations usi...
Hai Liu, Paul Hudak
ENTCS
2002
103views more  ENTCS 2002»
13 years 10 months ago
Deciding low levels of tree-automata hierarchy
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
Igor Walukiewicz
ATAL
2010
Springer
13 years 11 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
SIGPRO
2010
137views more  SIGPRO 2010»
13 years 8 months ago
Satellite image compression by post-transforms in the wavelet domain
This paper proposes a novel compression scheme with a tunable complexity-ratedistortion trade-off. As images increase in size and resolution, more efficient compression schemes w...
Xavier Delaunay, Marie Chabert, Vincent Charvillat...