Sciweavers

3618 search results - page 112 / 724
» Additive functions for number systems in function fields
Sort
View
139
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
From HCI to Software Engineering and Back
Methods to assess and ensure system usability are becoming increasingly important as market edge becomes less dependent on function and more dependent on ease of use, and as recog...
José Creissac Campos, Michael D. Harrison
CSB
2004
IEEE
154views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Multi-Knockout Genetic Network Analysis: The Rad6 Example
A novel and rigorous Multi-perturbation Shapley Value Analysis (MSA) method has been recently presented [12]. The method addresses the challenge of defining and calculating the fu...
Alon Kaufman, Martin Kupiec, Eytan Ruppin
ESOP
2008
Springer
15 years 5 months ago
Upper Adjoints for Fast Inter-procedural Variable Equalities
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
Markus Müller-Olm, Helmut Seidl
JACM
2000
119views more  JACM 2000»
15 years 3 months ago
A minimum spanning tree algorithm with Inverse-Ackermann type complexity
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
Bernard Chazelle
NIPS
2000
15 years 5 months ago
Learning Continuous Distributions: Simulations With Field Theoretic Priors
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
Ilya Nemenman, William Bialek