Sciweavers

6202 search results - page 232 / 1241
» Without Loss of Generality
Sort
View
CICLING
2009
Springer
16 years 7 months ago
Improved Unsupervised Name Discrimination with Very Wide Bigrams and Automatic Cluster Stopping
We cast name discrimination as a problem in clustering short contexts. Each occurrence of an ambiguous name is treated independently, and represented using second?order context vec...
Ted Pedersen
CHI
2005
ACM
16 years 7 months ago
Pollen: promoting the exchange of meaningful objects
One of the most trying aspects of growing old is the loss of loved ones. Older people often experience depression as a result of this reality. Without regular contact from friends...
Stefanie Danhope-Smith, Payaal Patel
CADE
2002
Springer
16 years 7 months ago
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
Robert R. Schneck, George C. Necula
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
16 years 7 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
16 years 6 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...