Sciweavers

435 search results - page 58 / 87
» Hierarchical presentation of expansion terms
Sort
View
135
Voted
ATAL
2011
Springer
14 years 23 days ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
BMCBI
2007
166views more  BMCBI 2007»
15 years 24 days ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
WWW
2004
ACM
16 years 1 months ago
OntoMiner: bootstrapping ontologies from overlapping domain specific web sites
In this paper, we present automated techniques for bootstrapping and populating specialized domain ontologies by organizing and mining a set of relevant overlapping Web sites prov...
Hasan Davulcu, Srinivas Vadrevu, Saravanakumar Nag...
116
Voted
ICMCS
2009
IEEE
140views Multimedia» more  ICMCS 2009»
14 years 10 months ago
Resource-adaptive multimedia analysis on stream mining systems
Large-scale multimedia semantic concept detection requires realtime identification of a set of concepts in streaming video or large image datasets. The potentially high data volum...
Deepak S. Turaga, Rong Yan, Olivier Verscheure, Br...
115
Voted
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 1 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...