Sciweavers

1283 search results - page 77 / 257
» Probabilistic structured query methods
Sort
View
ECCC
2010
140views more  ECCC 2010»
13 years 3 months ago
Query-Efficient Locally Decodable Codes
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
SSPR
1998
Springer
14 years 1 months ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
CORR
2010
Springer
230views Education» more  CORR 2010»
13 years 5 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
14 years 3 months ago
Active Learning with Generalized Queries
—Active learning can actively select or construct examples to label to reduce the number of labeled examples needed for building accurate classifiers. However, previous works of...
Jun Du, Charles X. Ling
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
14 years 2 months ago
Estimating XML Structural Join Size Quickly and Economically
XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structu...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Ch...