Sciweavers

485 search results - page 45 / 97
» Weighted Factorization
Sort
View
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
BMCBI
2006
242views more  BMCBI 2006»
13 years 8 months ago
Predicting residue-wise contact orders in proteins by support vector regression
Background: The residue-wise contact order (RWCO) describes the sequence separations between the residues of interest and its contacting residues in a protein sequence. It is a ne...
Jiangning Song, Kevin Burrage
MOC
2002
118views more  MOC 2002»
13 years 7 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
ICSE
2008
IEEE-ACM
14 years 8 months ago
Towards individualized software engineering: empirical studies should collect psychometrics
Even though software is developed by humans, research in software engineering primarily focuses on the technologies, methods and processes they use while disregarding the importan...
Robert Feldt, Richard Torkar, Lefteris Angelis, Ma...
GRID
2008
Springer
13 years 9 months ago
Scheduling on the Grid via multi-state resource availability prediction
To make the most effective application placement decisions on volatile large-scale heterogeneous Grids, schedulers must consider factors such as resource speed, load, and reliabil...
Brent Rood, Michael J. Lewis