Sciweavers

2783 search results - page 267 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
WWW
2007
ACM
16 years 2 months ago
A no-frills architecture for lightweight answer retrieval
In a new model for answer retrieval, document collections are distilled offline into large repositories of facts. Each fact constitutes a potential direct answer to questions seek...
Marius Pasca
TCC
2009
Springer
112views Cryptology» more  TCC 2009»
16 years 2 months ago
Non-malleable Obfuscation
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfus...
Ran Canetti, Mayank Varia
105
Voted
OSDI
2006
ACM
16 years 2 months ago
A Modular Network Layer for Sensornets
An overall sensornet architecture would help tame the increasingly complex structure of wireless sensornet software and help foster greater interoperability between different code...
Cheng Tien Ee, Rodrigo Fonseca, Sukun Kim, Daekyeo...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 2 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
111
Voted
ICFP
2008
ACM
16 years 1 months ago
Pattern minimization problems over recursive data types
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
Alexander Krauss