Sciweavers

9842 search results - page 1499 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
MLDM
2001
Springer
15 years 11 months ago
Local Learning Framework for Recognition of Lowercase Handwritten Characters
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...
Jian-xiong Dong, Adam Krzyzak, Ching Y. Suen
RANDOM
2001
Springer
15 years 11 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨©  ¤¥ ¦ §¨ belongs to a certain class of Boolean functions  or whether it is far from the...
Michal Parnas, Dana Ron, Alex Samorodnitsky
UM
2001
Springer
15 years 11 months ago
Utility-Based Decision Tree Optimization: A Framework for Adaptive Interviewing
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
Markus Stolze, Michael Ströbel
VLDB
2001
ACM
113views Database» more  VLDB 2001»
15 years 11 months ago
Querying XML Views of Relational Data
XML has emerged as the standard data exchange format for Internet-based business applications. This has created the need to publish existing business data, stored in relational da...
Jayavel Shanmugasundaram, Jerry Kiernan, Eugene J....
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye
« Prev « First page 1499 / 1969 Last » Next »