Sciweavers

10289 search results - page 1822 / 2058
» Standard bases in K
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 7 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
VLDB
2007
ACM
131views Database» more  VLDB 2007»
16 years 6 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
SIGMOD
2008
ACM
95views Database» more  SIGMOD 2008»
16 years 6 months ago
Interactive generation of integrated schemas
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa
PERCOM
2006
ACM
16 years 6 months ago
Exploiting information relationships for access control in pervasive computing
Many information services in pervasive computing offer rich information, which is information that includes other types of information. For example, the information listed in a pe...
Urs Hengartner, Peter Steenkiste
ICWS
2009
IEEE
16 years 3 months ago
Service Supervision: Coordinating Web Services in Open Environment
ite Web service designed based on abstract Web services, which define only interfaces, allows an application developer to select services required for his application only by set...
Masahiro Tanaka, Toru Ishida, Yohei Murakami, Sato...
« Prev « First page 1822 / 2058 Last » Next »