Sciweavers

599 search results - page 117 / 120
» The repeater tree construction problem
Sort
View
EMNLP
2007
14 years 10 days ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 11 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
BMCBI
2010
140views more  BMCBI 2010»
13 years 8 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu
ICCD
2006
IEEE
86views Hardware» more  ICCD 2006»
14 years 7 months ago
Interconnect Matching Design Rule Inferring and Optimization through Correlation Extraction
— New back-end design for manufacturability rules have brought guarantee rules for interconnect matching. These rules indicate a certain capacitance matching guarantee given spac...
Rasit Onur Topaloglu, Andrew B. Kahng
HASKELL
2009
ACM
14 years 5 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...