Sciweavers

1149 search results - page 218 / 230
» Minimally non-Pfaffian graphs
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A Decomposition Technique for Max-CSP
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
Hachemi Bennaceur, Christophe Lecoutre, Olivier Ro...
CCCG
2007
13 years 8 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 8 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
SDM
2010
SIAM
156views Data Mining» more  SDM 2010»
13 years 8 months ago
Unsupervised Discovery of Abnormal Activity Occurrences in Multi-dimensional Time Series, with Applications in Wearable Systems
We present a method for unsupervised discovery of abnormal occurrences of activities in multi-dimensional time series data. Unsupervised activity discovery approaches differ from ...
Alireza Vahdatpour, Majid Sarrafzadeh
PST
2008
13 years 8 months ago
An Access Control Scheme for Protecting Personal Data
This paper presents a new personal data access control (PDAC) scheme that is inspired by the protection schemes practiced in communities for sharing valuable commodities. The PDAC...
Wilfred Villegas, Bader Ali, Muthucumaru Maheswara...