219 search results - page 30 / 44 » Maximum common subgraph: some upper bound and lower bound re... |
132
click to vote
IJCGA
2010
14 years 12 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
105
click to vote
IJCAI
2007
15 years 2 months ago
2007
This paper is a comparative study of game-theoretic solution concepts in strictly competitive multiagent scenarios, as commonly encountered in the context of parlor games, competi...
DAGSTUHL
2007
15 years 2 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
131
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
PODS
1997
ACM
15 years 5 months ago
1997
ACM
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...