Sciweavers

2577 search results - page 502 / 516
» Multimedia Question Answering
Sort
View
JSYML
1998
61views more  JSYML 1998»
13 years 8 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
TSE
2002
157views more  TSE 2002»
13 years 8 months ago
Assessing the Applicability of Fault-Proneness Models Across Object-Oriented Software Projects
A number of papers have investigated the relationships between design metrics and the detection of faults in object-oriented software. Several of these studies have shown that suc...
Lionel C. Briand, Walcélio L. Melo, Jü...
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 8 months ago
To Code or Not To Code in Multi-Hop Relay Channels
Multi-hop relay channels use multiple relay stages, each with multiple relay nodes, to facilitate communication between a source and destination. Previously, distributed space-tim...
Rahul Vaze, Robert W. Heath Jr.
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Enhanced Bayesian modelling in BAPS software for learning genetic structures of populations
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
Jukka Corander, Pekka Marttinen, Jukka Siré...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...