Sciweavers

2312 search results - page 193 / 463
» The complexity of estimating min-entropy
Sort
View
JOCN
2010
126views more  JOCN 2010»
15 years 5 months ago
Evidence for Early Morphological Decomposition in Visual Word Recognition
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
Olla Solomyak, Alec Marantz
CVPR
2010
IEEE
15 years 3 months ago
Curious snakes: A minimum latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embedd...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony J. ...
XSYM
2004
Springer
129views Database» more  XSYM 2004»
15 years 12 months ago
Fractional XSketch Synopses for XML Databases
A key step in the optimization of declarative queries over XML data is estimating the selectivity of path expressions, i.e., the number of elements reached by a specific navigatio...
Natasha Drukh, Neoklis Polyzotis, Minos N. Garofal...
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
16 years 6 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 11 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...