Sciweavers

206 search results - page 38 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
ECCV
2010
Springer
15 years 1 months ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
15 years 11 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
CN
2006
112views more  CN 2006»
14 years 9 months ago
Optimal server allocations for streaming multimedia applications on the Internet
In this paper, we address the server selection problem for streaming applications on the Internet. The architecture we consider is similar to the content distribution networks con...
Padmavathi Mundur, Poorva Arankalle
HRI
2009
ACM
15 years 4 months ago
How to approach humans?: strategies for social robots to initiate interaction
This paper proposes a model of approach behavior with which a robot can initiate conversation with people who are walking. We developed the model by learning from the failures in ...
Satoru Satake, Takayuki Kanda, Dylan F. Glas, Mich...
ISESE
2005
IEEE
15 years 3 months ago
Exploratory testing: a multiple case study
Exploratory testing (ET) – simultaneous learning, test design, and test execution – is an applied practice in industry but lacks research. We present the current knowledge of ...
Juha Itkonen, Kristian Rautiainen