Sciweavers

3791 search results - page 40 / 759
» Packing sets of patterns
Sort
View
66
Voted
ICML
2005
IEEE
15 years 12 months ago
Hedged learning: regret-minimization with learning experts
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...
Yu-Han Chang, Leslie Pack Kaelbling
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
15 years 5 months ago
Grasping POMDPs
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...
Kaijen Hsiao, Leslie Pack Kaelbling, Tomás ...
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 11 months ago
The Plane-Width of Graphs
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...
Marcin Kaminski, Paul Medvedev, Martin Milanic
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
16 years 15 days ago
Mining Colossal Frequent Patterns by Core Pattern Fusion
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...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, H...
ITNG
2006
IEEE
15 years 5 months ago
Closed Multidimensional Sequential Pattern Mining
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...
Panida Songram, Veera Boonjing, Sarun Intakosum