2168 search results - page 264 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
145
click to vote
CIKM
2005
Springer
15 years 10 months ago
2005
Springer
Depending on a web searcher’s familiarity with a query’s target topic, it may be more appropriate to show her introductory or advanced documents. The TREC HARD [1] track defi...
192
click to vote
EDBT
2011
ACM
14 years 8 months ago
2011
ACM
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
130
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
176
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
129
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Local experts have been used to great effect for fitting deformable
models to images. Typically, the best location in
an image for the deformable model’s landmarks are found
t...