Sciweavers

429 search results - page 62 / 86
» Improved Algorithms for the k Maximum-Sums Problems
Sort
View
ICPR
2004
IEEE
15 years 11 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
VLSID
2002
IEEE
107views VLSI» more  VLSID 2002»
15 years 10 months ago
Estimation of Maximum Power-Up Current
Power gating is emerging as a viable solution to reduction of leakage current. However, power gated circuits are different from the conventional designs in the sense that a power-...
Fei Li, Lei He, Kewal K. Saluja
ICALP
2010
Springer
14 years 12 months ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
COR
2004
111views more  COR 2004»
14 years 9 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
WEBI
2009
Springer
15 years 4 months ago
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
Andrea Bernardini, Claudio Carpineto, Massimiliano...