Sciweavers

10633 search results - page 1991 / 2127
» Relating Distributed Objects
Sort
View
POPL
2005
ACM
14 years 10 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...
STOC
2005
ACM
164views Algorithms» more  STOC 2005»
14 years 10 months ago
Cooperative asynchronous update of shared memory
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
Bogdan S. Chlebus, Dariusz R. Kowalski
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
VLDB
2007
ACM
141views Database» more  VLDB 2007»
14 years 10 months ago
Query Processing over Incomplete Autonomous Databases
Incompleteness due to missing attribute values (aka "null values") is very common in autonomous web databases, on which user accesses are usually supported through media...
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianc...
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 10 months ago
Exploiting context analysis for combining multiple entity resolution systems
Entity Resolution (ER) is an important real world problem that has attracted significant research interest over the past few years. It deals with determining which object descript...
Zhaoqi Chen, Dmitri V. Kalashnikov, Sharad Mehrotr...
« Prev « First page 1991 / 2127 Last » Next »