Sciweavers

3652 search results - page 134 / 731
» A study of query length
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
PVLDB
2010
118views more  PVLDB 2010»
13 years 6 months ago
Ten Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Lu Qin, Jefferey Yu, Lijun Chang
DCC
2008
IEEE
14 years 7 months ago
Improved versions of Tardos' fingerprinting scheme
We study the Tardos' probabilistic fingerprinting scheme and show that its codeword length may be shortened by a factor of approximately 4. We achieve this by retracing Tardo...
Oded Blayer, Tamir Tassa
ICCD
2007
IEEE
111views Hardware» more  ICCD 2007»
14 years 5 months ago
On modeling impact of sub-wavelength lithography on transistors
As the VLSI technology marches beyond 65 and 45nm process technologies, variation in gate length has a direct impact on leakage and performance of CMOS transistors. Due to sub-wav...
Aswin Sreedhar, Sandip Kundu