Sciweavers

446 search results - page 64 / 90
» On the Interactive Complexity of Graph Reliability
Sort
View
HEURISTICS
2010
13 years 2 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
PPDP
2009
Springer
14 years 2 months ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
CVPR
2007
IEEE
14 years 9 months ago
Layered Depth Panoramas
Representations for interactive photorealistic visualization of scenes range from compact 2D panoramas to dataintensive 4D light fields. In this paper, we propose a technique for ...
Ke Colin Zheng, Sing Bing Kang, Michael F. Cohen, ...
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
14 years 2 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 2 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han