Sciweavers

217 search results - page 20 / 44
» On the Fine Structure of Large Search Spaces
Sort
View
VLDB
2003
ACM
147views Database» more  VLDB 2003»
15 years 12 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
CAIP
2003
Springer
222views Image Analysis» more  CAIP 2003»
15 years 5 months ago
Learning Statistical Structure for Object Detection
Abstract. Many classes of images exhibit sparse structuring of statistical dependency. Each variable has strong statistical dependency with a small number of other variables and ne...
Henry Schneiderman
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ECOOP
2007
Springer
15 years 3 months ago
Efficiently Generating Structurally Complex Inputs with Thousands of Objects
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
Bassem Elkarablieh, Yehia Zayour, Sarfraz Khurshid
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
14 years 9 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis