Sciweavers

28888 search results - page 310 / 5778
» Computability and complexity in analysis
Sort
View
ISSAC
2009
Springer
144views Mathematics» more  ISSAC 2009»
16 years 1 months ago
H-LLL: using householder inside LLL
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
Ivan Morel, Damien Stehlé, Gilles Villard
ASIAMS
2008
IEEE
15 years 8 months ago
A Blended Text Mining Method for Authorship Authentication Analysis
The paper elaborates upon the interim results achieved in resolving a few newly discovered 16th century letters now alleged to be written by Queen Mary of Scots (QMS). Despite the...
Philip Sallis, Subana Shanmuganathan
ENTCS
2007
116views more  ENTCS 2007»
15 years 6 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
ATAL
2010
Springer
15 years 7 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
PLDI
2009
ACM
16 years 7 months ago
Semantics-aware trace analysis
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...