Sciweavers

2797 search results - page 153 / 560
» Code query by example
Sort
View
IJBRA
2006
61views more  IJBRA 2006»
15 years 3 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
JPDC
2006
83views more  JPDC 2006»
15 years 3 months ago
Virtual Leashing: Creating a computational foundation for software protection
We introduce Virtual Leashing,1 a new technique for software protection and control. The leashing process removes small fragments of code, pervasive throughout the application, an...
Ori Dvir, Maurice Herlihy, Nir Shavit
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 2 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
ICDE
2004
IEEE
138views Database» more  ICDE 2004»
16 years 4 months ago
Making the Pyramid Technique Robust to Query Types and Workloads
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
Rui Zhang 0003, Beng Chin Ooi, Kian-Lee Tan
WWW
2009
ACM
16 years 3 months ago
Understanding user's query intent with wikipedia
Understanding the intent behind a user's query can help search engine to automatically route the query to some corresponding vertical search engines to obtain particularly re...
Jian Hu, Gang Wang, Frederick H. Lochovsky, Jian-T...