3791 search results - page 40 / 759 » Packing sets of patterns |
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
In non-cooperative multi-agent situations, there cannot exist a globally optimal, yet opponent-independent learning algorithm. Regret-minimization over a set of strategies optimiz...
124
click to vote
ICRA
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— We provide a method for planning under uncertainty for robotic manipulation by partitioning the configuration space into a set of regions that are closed under complia...
109
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is th...
222
click to vote
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
173
click to vote
ITNG
2006
IEEE
15 years 8 months ago
2006
IEEE
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequ...