Sciweavers

933 search results - page 21 / 187
» Monotone Complexity of a Pair
Sort
View
DCG
2011
13 years 2 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
ICCS
2004
Springer
14 years 26 days ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo
SOFSEM
2010
Springer
14 years 4 months ago
On the Complexity of the Highway Pricing Problem
Abstract. The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers wit...
Alexander Grigoriev, Joyce van Loon, Marc Uetz
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
14 years 1 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
LREC
2010
180views Education» more  LREC 2010»
13 years 9 months ago
A Comprehensive Resource to Evaluate Complex Open Domain Question Answering
We describe two corpora of question and answer pairs collected for complex, open-domain Question Answering (QA) to enable answer classification and re-ranking experiments. We deli...
Silvia Quarteroni, Alessandro Moschitti