Sciweavers

2440 search results - page 161 / 488
» Data-Intensive Question Answering
Sort
View
DAM
2007
129views more  DAM 2007»
13 years 10 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
DCG
2007
76views more  DCG 2007»
13 years 10 months ago
Packing Cones and Their Negatives in Space
Let C be a cone in R3 whose base B is a planar convex body in a horizontal plane π and whose tip is a point v /∈ π. Let C be a packing formed by translates of C and −C in R3...
Imre Bárány, Jirí Matousek
DM
2007
93views more  DM 2007»
13 years 10 months ago
Small subgraphs of random regular graphs
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
Jeong Han Kim, Benny Sudakov, Van H. Vu
MP
2008
82views more  MP 2008»
13 years 10 months ago
Newton's iterates can converge to non-stationary points
Abstract In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hes...
Walter F. Mascarenhas
FUIN
2007
79views more  FUIN 2007»
13 years 10 months ago
An Interpretation of Robinson Arithmetic in its Grzegorczyk's Weaker Variant
Q− is a weaker variant of Robinson arithmetic Q in which addition and multiplication are partial functions, i.e. ternary relations that are graphs of possibly non-total function...
Vítezslav Svejdar