Sciweavers

194 search results - page 20 / 39
» The Polytope of Degree Partitions
Sort
View
IEEEARES
2006
IEEE
15 years 5 months ago
DeDiSys Lite: An Environment for Evaluating Replication Protocols in Partitionable Distributed Object Systems
Distributed object systems for partitionable systems present a challenge, in that there is a trade-off between availability and consistency. Changes in one partition are not visib...
Stefan Beyer, Alexander Sanchez, Francesc D. Mu&nt...
ATVA
2005
Springer
111views Hardware» more  ATVA 2005»
15 years 5 months ago
Model Checking Prioritized Timed Automata
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
Shang-Wei Lin, Pao-Ann Hsiung, Chun-Hsian Huang, Y...
DM
2008
76views more  DM 2008»
14 years 12 months ago
Graphic sequences with a realization containing a complete multipartite subgraph
A nonincreasing sequence of nonnegative integers = (d1, d2, ..., dn) is graphic if there is a (simple) graph G of order n having degree sequence . In this case, G is said to reali...
Guantao Chen, Michael Ferrara, Ronald J. Gould, Jo...
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
14 years 9 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos
CSE
2009
IEEE
14 years 9 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang