963 search results - page 90 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
107
click to vote
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
100
click to vote
CIVR
2007
Springer
15 years 6 months ago
2007
Springer
Bag-of-features (BoF) deriving from local keypoints has recently appeared promising for object and scene classification. Whether BoF can naturally survive the challenges such as ...
WWW
2005
ACM
16 years 16 days ago
2005
ACM
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
140
click to vote
AAAI
2008
15 years 2 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjecti...