Sciweavers

1187 search results - page 232 / 238
» Constructing Distributed Representations Using Additive Clus...
Sort
View
226
Voted
POPL
2005
ACM
16 years 2 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
16 years 2 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
GI
1997
Springer
15 years 5 months ago
Persistent Object Systems: From Technology to Market
Abstract. This text describes how persistent object system technology developed in European basic research is being used by a small German startup software company to realize innov...
Andreas Gawecki, Florian Matthes, Joachim W. Schmi...
JCT
2000
111views more  JCT 2000»
15 years 2 months ago
Immanants and Finite Point Processes
Givena Hermitian,non-negativede nitekernelK and a character of the symmetric group on n letters, de ne the corresponding immanant function K x1;::: ;xn := P Qn i=1 Kxi;x i, where ...
Persi Diaconis, Steven N. Evans
145
Voted
KBSE
2010
IEEE
15 years 23 days ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer