Sciweavers

3913 search results - page 123 / 783
» complexity 2006
Sort
View
MP
2007
95views more  MP 2007»
13 years 9 months ago
Smoothed analysis of integer programming
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
Heiko Röglin, Berthold Vöcking
COORDINATION
2006
Springer
14 years 1 months ago
A Logical View of Choreography
Abstract. We present a model for choreography `a la WS-CDL and formalize it in DSTL(x), a spatio
Carlo Montangero, Laura Semini
CTRSA
2006
Springer
107views Cryptology» more  CTRSA 2006»
14 years 1 months ago
A Round and Communication Efficient Secure Ranking Protocol
In this work, we initiate the study of realizing a ranking functionality (m1,
Shaoquan Jiang, Guang Gong
CACM
2006
95views more  CACM 2006»
13 years 10 months ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 1 months ago
A Framework for Distributed XML Data Management
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
Serge Abiteboul, Ioana Manolescu, Emanuel Taropa