Sciweavers

146 search results - page 1 / 30
» On the Structure of Sequential Search: Beyond
Sort
View
EVOW
2004
Springer
13 years 10 months ago
On the Structure of Sequential Search: Beyond "No Free Lunch"
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
Thomas M. English
DAGM
2006
Springer
13 years 9 months ago
Efficient Algorithms for Similarity Measures over Sequential Data: A Look Beyond Kernels
Kernel functions as similarity measures for sequential data have been extensively studied in previous research. This contribution addresses the efficient computation of distance fu...
Konrad Rieck, Pavel Laskov, Klaus-Robert Müll...
CLUSTER
2007
IEEE
13 years 11 months ago
Sequential and parallel implementation of a constraint-based algorithm for searching protein structures
— Data mining in biological structure libraries can be a powerful tool to better understand biochemical processes. This article introduces the LISA algorithm which enables the re...
Sascha Hunold, Thomas Rauber, Georg Wille
SIGMOD
2008
ACM
119views Database» more  SIGMOD 2008»
14 years 5 months ago
Webpage understanding: beyond page-level search
In this paper we introduce the webpage understanding problem which consists of three subtasks: webpage segmentation, webpage structure labeling, and webpage text segmentation and ...
Zaiqing Nie, Ji-Rong Wen, Wei-Ying Ma
AIPS
2007
13 years 7 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak