Sciweavers

1760 search results - page 134 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 8 months ago
Multiple intents re-ranking
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
IPPS
2009
IEEE
14 years 2 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
SAC
2008
ACM
13 years 7 months ago
Test generation and minimization with "basic" statecharts
Model-based testing as a black-box testing technique has grown in importance. The models used represent the relevant features of the system under consideration (SUC), and can also...
Fevzi Belli, Axel Hollmann
CEC
2008
IEEE
14 years 2 months ago
Automatic model type selection with heterogeneous evolution: An application to RF circuit block modeling
— Many complex, real world phenomena are difficult to study directly using controlled experiments. Instead, the use of computer simulations has become commonplace as a cost effe...
Dirk Gorissen, Luciano De Tommasi, Jeroen Croon, T...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Maximal Quasi-Bicliques with Balanced Noise Tolerance: Concepts and Co-clustering Applications
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
Jinyan Li, Kelvin Sim, Guimei Liu, Limsoon Wong