Sciweavers

608 search results - page 120 / 122
» Random Systems with Complete Connections
Sort
View
OOPSLA
2010
Springer
13 years 8 months ago
Managing ambiguity in programming by finding unambiguous examples
We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming env...
Kenneth C. Arnold, Henry Lieberman
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
14 years 4 months ago
Iterative Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a partial set of “seed” objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), which e...
Richard C. Wang, William W. Cohen
INFOCOM
2005
IEEE
14 years 3 months ago
Dynamic node activation in networks of rechargeable sensors
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
Koushik Kar, Ananth Krishnamurthy, Neeraj Jaggi
BMCBI
2010
149views more  BMCBI 2010»
13 years 9 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...