Sciweavers

4894 search results - page 970 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
BMCBI
2002
119views more  BMCBI 2002»
13 years 7 months ago
Microarray results: how accurate are they?
Background: DNA microarray technology is a powerful technique that was recently developed in order to analyze thousands of genes in a short time. Presently, microarrays, or chips,...
Ravi Kothapalli, Sean J. Yoder, Shrikant Mane, Tho...
CORR
2002
Springer
98views Education» more  CORR 2002»
13 years 7 months ago
An Empirical Model for Volatility of Returns and Option Pricing
In a seminal paper in 1973, Black and Scholes argued how expected distributions of stock prices can be used to price options. Their model assumed a directed random motion for the ...
Joseph L. McCauley, Gemunu H. Gunaratne
CORR
2002
Springer
105views Education» more  CORR 2002»
13 years 7 months ago
Effectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. Howe...
Benoît Hudson, Tuomas Sandholm
ETT
2002
89views Education» more  ETT 2002»
13 years 7 months ago
Delay analysis of a probabilistic priority discipline
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
Yuming Jiang, Chen-Khong Tham, Chi Chung Ko
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 7 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell