Sciweavers

717 search results - page 20 / 144
» Efficient implementation of SVM for large class problems
Sort
View
ICDCS
1998
IEEE
13 years 11 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen
IPPS
2010
IEEE
13 years 5 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ICML
2004
IEEE
14 years 8 months ago
Text categorization with many redundant features: using aggressive feature selection to make SVMs competitive with C4.5
Text categorization algorithms usually represent documents as bags of words and consequently have to deal with huge numbers of features. Most previous studies found that the major...
Evgeniy Gabrilovich, Shaul Markovitch
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
JWSR
2007
172views more  JWSR 2007»
13 years 7 months ago
Service Class Driven Dynamic Data Source Discovery with DynaBot
: Dynamic Web data sources – sometimes known collectively as the Deep Web – increase the utility of the Web by providing intuitive access to data repositories anywhere that Web...
Daniel Rocco, James Caverlee, Ling Liu, Terence Cr...