Sciweavers

1826 search results - page 312 / 366
» Using Random Forests in the Structured Language Model
Sort
View
BMCBI
2005
99views more  BMCBI 2005»
14 years 9 months ago
Effective ambiguity checking in biosequence analysis
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
Janina Reeder, Peter Steffen, Robert Giegerich
77
Voted
PODC
2009
ACM
15 years 10 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 4 months ago
Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals
The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectral...
Michael A. Lexa, Mike E. Davies, John S. Thompson
DAGSTUHL
2006
14 years 11 months ago
Are we Ready to Embrace the Semantic Web?
action from low level features to high level semantics. Owing to the proliferation of multimedia content in the internet, there is widespread interest in the semantic web community...
Shankar Vembu, Stephan Baumann
ECOOP
2010
Springer
15 years 2 months ago
The Essence of JavaScript
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
Arjun Guha, Claudiu Saftoiu, Shriram Krishnamurthi