Sciweavers

2841 search results - page 416 / 569
» A Call to Order
Sort
View
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
JDCTA
2010
152views more  JDCTA 2010»
15 years 1 months ago
A Semantic Approach to Extract the Final Answer in SBUQA Question Answering System
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
Mehrnoush Shamsfard, Mahsa Arab Yarmohammadi
PVLDB
2010
195views more  PVLDB 2010»
15 years 1 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
SIAMMA
2010
97views more  SIAMMA 2010»
15 years 1 months ago
Small Volume Fraction Limit of the Diblock Copolymer Problem: I. Sharp-Interface Functional
We present the first of two articles on the small volume fraction limit of a nonlocal Cahn-Hilliard functional introduced to model microphase separation of diblock copolymers. Her...
Rustum Choksi, Mark A. Peletier
TCS
2010
15 years 1 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal