Sciweavers

3652 search results - page 180 / 731
» A study of query length
Sort
View
CORR
2004
Springer
95views Education» more  CORR 2004»
13 years 8 months ago
Long Nonbinary Codes Exceeding the Gilbert - Varshamov Bound for any Fixed Distance
Let ( ) denote the maximum size of a -ary code of length and distance . We study the minimum asymptotic redundancy ( ) = log ( ) as grows while and are fixed. For any and 1, long a...
Sergey Yekhanin, Ilya Dumer
COMBINATORICS
2002
105views more  COMBINATORICS 2002»
13 years 8 months ago
Counting 1324-Avoiding Permutations
We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program pr...
Darko Marinov, Rados Radoicic
IPL
2002
71views more  IPL 2002»
13 years 7 months ago
Pancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
Toru Araki, Yukio Shibata
TON
2010
118views more  TON 2010»
13 years 2 months ago
Multicast Capacity of Wireless Ad Hoc Networks Under Gaussian Channel Model
We study the multicast capacity of large-scale random extended multihop wireless networks, where a number of wireless nodes are randomly located in a square region with side length...
Xiang-Yang Li, Yunhao Liu, Shi Li, ShaoJie Tang
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Optimizing SQL Queries over Text Databases
Text documents often embed data that is structured in nature, and we can expose this structured data using information extraction technology. By processing a text database with inf...
Alpa Jain, AnHai Doan, Luis Gravano