Sciweavers

107 search results - page 18 / 22
» Controlling Redundancy in Referring Expressions
Sort
View
APN
2006
Springer
13 years 9 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back
PKDD
2004
Springer
205views Data Mining» more  PKDD 2004»
14 years 21 days ago
Breaking Through the Syntax Barrier: Searching with Entities and Relations
The next wave in search technology will be driven by the identification, extraction, and exploitation of real-world entities represented in unstructured textual sources. Search sy...
Soumen Chakrabarti
SP
2003
IEEE
116views Security Privacy» more  SP 2003»
14 years 18 days ago
Garbage Collector Memory Accounting in Language-Based Systems
Language run-time systems are often called upon to safely execute mutually distrustful tasks within the same runtime, protecting them from other tasks’ bugs or otherwise hostile...
David W. Price, Algis Rudys, Dan S. Wallach
ACSAC
2010
IEEE
13 years 5 months ago
Porscha: policy oriented secure content handling in Android
The penetration of cellular networks worldwide and emergence of smart phones has led to a revolution in mobile content. Users consume diverse content when, for example, exchanging...
Machigar Ongtang, Kevin R. B. Butler, Patrick Drew...
BMCBI
2010
108views more  BMCBI 2010»
13 years 2 months ago
Preferred analysis methods for Affymetrix GeneChips. II. An expanded, balanced, wholly-defined spike-in dataset
Background: Concomitant with the rise in the popularity of DNA microarrays has been a surge of proposed methods for the analysis of microarray data. Fully controlled "spike-i...
Qianqian Zhu, Jeffrey C. Miecznikowski, Marc S. Ha...