Sciweavers

7065 search results - page 1164 / 1413
» Iterative Scheduling Algorithms
Sort
View
IJCAI
1989
15 years 7 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
ECCV
2010
Springer
15 years 6 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
189
Voted
AAI
2007
132views more  AAI 2007»
15 years 6 months ago
Incremental Extraction of Association Rules in Applicative Domains
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
Arianna Gallo, Roberto Esposito, Rosa Meo, Marco B...
BMCBI
2008
242views more  BMCBI 2008»
15 years 6 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
COMCOM
2006
86views more  COMCOM 2006»
15 years 6 months ago
Study on nominee selection for multicast congestion control
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design...
Feng Xie, Gang Feng, Chee Kheong Siew
« Prev « First page 1164 / 1413 Last » Next »