Sciweavers

1814 search results - page 221 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
16 years 7 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 7 months ago
Efficient ticket routing by resolution sequence mining
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...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
ICCV
2007
IEEE
16 years 8 months ago
Image Classification using Random Forests and Ferns
We explore the problem of classifying images by the object categories they contain in the case of a large number of object categories. To this end we combine three ingredients: (i...
Andrew Zisserman, Anna Bosch, Xavier Muñoz
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
16 years 1 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
HPDC
2007
IEEE
16 years 28 days ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...