Sciweavers

1243 search results - page 176 / 249
» Generating Trees on Multisets
Sort
View
NLP
2000
15 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
VISSYM
2004
14 years 11 months ago
A Botanically Inspired High-Dimensional Visualization with Multivariate Glyphs
It is difficult for the average viewer to assimilate and comprehend huge amounts of high-dimensional data. It is important to present data in a way that allows the user a high lev...
Eleanor Boyle Chlan, Penny Rheingans
BMCBI
2008
71views more  BMCBI 2008»
14 years 10 months ago
Examining the significance of fingerprint-based classifiers
Background: Experimental examinations of biofluids to measure concentrations of proteins or their fragments or metabolites are being explored as a means of early disease detection...
Brian T. Luke, Jack R. Collins
TASLP
2008
96views more  TASLP 2008»
14 years 9 months ago
Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
Fabio Antonacci, M. Foco, Augusto Sarti, Stefano T...
POPL
2011
ACM
14 years 20 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu