Sciweavers

592 search results - page 81 / 119
» Crossing numbers of random graphs
Sort
View
LREC
2010
184views Education» more  LREC 2010»
13 years 9 months ago
New Features in Spoken Language Search Hawk (SpLaSH): Query Language and Query Sequence
In this work we present further development of the SpLaSH (Spoken Language Search Hawk) project. SpLaSH implements a data model for annotated speech corpora integrated with textua...
Sara Romano, Francesco Cutugno
RSA
2010
107views more  RSA 2010»
13 years 6 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
WWW
2011
ACM
13 years 2 months ago
Estimating sizes of social networks via biased sampling
Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions. For various commercial and sociological...
Liran Katzir, Edo Liberty, Oren Somekh
TCOM
2010
109views more  TCOM 2010»
13 years 6 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
IEEEPACT
1997
IEEE
14 years 5 days ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad