Sciweavers

1133 search results - page 195 / 227
» Basics of Graph Cuts
Sort
View
DASFAA
2004
IEEE
92views Database» more  DASFAA 2004»
14 years 20 days ago
Modeling Temporally Variable Transportation Networks
In this paper, a State-Based Dynamic Transportation Network (SBDTN) model is presented, which can be used to describe the spatiotemporal aspect of temporally variable transportatio...
Zhiming Ding, Ralf Hartmut Güting
USENIX
2007
13 years 11 months ago
A Comparison of Structured and Unstructured P2P Approaches to Heterogeneous Random Peer Selection
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
Vivek Vishnumurthy, Paul Francis
CCS
2008
ACM
13 years 11 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
GG
2008
Springer
13 years 10 months ago
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...
Guilherme Rangel, Leen Lambers, Barbara König...
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 9 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet