Sciweavers

93 search results - page 2 / 19
» Further results on large sets of Kirkman triple systems
Sort
View
WCRE
1995
IEEE
13 years 8 months ago
On Finding Duplication and Near-Duplication in Large Software Systems
This paper describes how a program called dup can be used to locate instances of duplication or nearduplication in a software system. D u p reports both textually identical sectio...
Brenda S. Baker
JCT
2008
76views more  JCT 2008»
13 years 5 months ago
Quadruple systems with independent neighborhoods
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
Zoltán Füredi, Dhruv Mubayi, Oleg Pikh...
CN
2007
129views more  CN 2007»
13 years 5 months ago
Machine-learnt versus analytical models of TCP throughput
We first study the accuracy of two well-known analytical models of the average throughput of long-term TCP flows, namely the so-called SQRT and PFTK models, and show that these ...
Ibtissam El Khayat, Pierre Geurts, Guy Leduc
WWW
2008
ACM
14 years 6 months ago
Temporal views over rdf data
Supporting fast access to large RDF stores has been one of key challenges for enabling use of the Semantic Web in real-life applications, more so in sensor-based systems where lar...
Craig Sayers, Geetha Manjunath, K. S. Venugopal, R...
TASLP
2008
148views more  TASLP 2008»
13 years 5 months ago
Combining Spectral Representations for Large-Vocabulary Continuous Speech Recognition
In this paper we investigate the combination of complementary acoustic feature streams in large vocabulary continuous speech recognition (LVCSR). We have explored the use of acoust...
Giulia Garau, Steve Renals