496 search results - page 20 / 100 » Machine models and lower bounds for query processing |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
COR
2011
14 years 4 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
EUROPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper presents a novel approach to language modeling for voice search based on the idea and method of statistical machine translation. We propose an n-gram based translation ...