Sciweavers

2981 search results - page 413 / 597
» Word Sense and Subjectivity
Sort
View
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 6 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
CORR
2010
Springer
129views Education» more  CORR 2010»
15 years 6 months ago
ML(n)BiCGStab: Reformulation, Analysis and Implementation
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...
Man-Chung Yeung
DAM
2010
81views more  DAM 2010»
15 years 6 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
DM
2010
132views more  DM 2010»
15 years 6 months ago
Diameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given ...
Martin Knor, Sanming Zhou
CSDA
2008
108views more  CSDA 2008»
15 years 6 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes