Sciweavers

11151 search results - page 375 / 2231
» On the Complexity of Model Expansion
Sort
View
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
16 years 2 months ago
Algorithmic Aspects of Property Testing in the Dense Graphs Model
In this paper we consider two basic questions regarding the query complexity of testing graph properties in the adjacency matrix model. The first question refers to the relation ...
Oded Goldreich, Dana Ron
EMMCVPR
2005
Springer
16 years 1 months ago
Deformable-Model Based Textured Object Segmentation
Abstract. In this paper, we present a deformable-model based solution for segmenting objects with complex texture patterns of all scales. The external image forces in traditional d...
Xiaolei Huang, Zhen Qian, Rui Huang, Dimitris N. M...
COMPULOG
1999
Springer
15 years 12 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
DEBS
2007
ACM
15 years 11 months ago
A QoS policy configuration modeling language for publish/subscribe middleware platforms
Publish/subscribe (pub/sub) middleware platforms for eventbased distributed systems often provide many configurable policies that affect end-to-end quality of service (QoS). Altho...
Joe Hoffert, Douglas C. Schmidt, Aniruddha S. Gokh...
201
Voted
DIS
2009
Springer
15 years 11 months ago
Discovering Influential Nodes for SIS Models in Social Networks
We address the problem of efficiently discovering the influential nodes in a social network under the susceptible/infected/susceptible (SIS) model, a diffusion model where nodes ar...
Kazumi Saito, Masahiro Kimura, Hiroshi Motoda