Sciweavers

892 search results - page 85 / 179
» Calculating with Requirements
Sort
View
JCT
2006
100views more  JCT 2006»
15 years 5 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
BMCBI
2005
250views more  BMCBI 2005»
15 years 5 months ago
FiatFlux - a software for metabolic flux analysis from 13C-glucose experiments
Background: Quantitative knowledge of intracellular fluxes is important for a comprehensive characterization of metabolic networks and their functional operation. In contrast to d...
Nicola Zamboni, Eliane Fischer, Uwe Sauer
PE
2010
Springer
102views Optimization» more  PE 2010»
15 years 3 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
CVPR
2006
IEEE
16 years 7 months ago
When Fisher meets Fukunaga-Koontz: A New Look at Linear Discriminants
The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to Fisher's Criteri...
Sheng Zhang, Terence Sim
DCOSS
2005
Springer
15 years 11 months ago
A Local Facility Location Algorithm for Sensor Networks
In this paper we address a well-known facility location problem (FLP) in a sensor network environment. The problem deals with finding the optimal way to provide service to a (poss...
Denis Krivitski, Assaf Schuster, Ran Wolff