Sciweavers

5316 search results - page 172 / 1064
» Which Search Problems Are Random
Sort
View
CVPR
2012
IEEE
13 years 6 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
CIDR
2007
92views Algorithms» more  CIDR 2007»
15 years 5 months ago
Predicate-based Indexing of Enterprise Web Applications
Searching the Web has become a commodity. However, extending applications with search capabilities is still an open research topic [2]. Large enterprise applications such as SAP a...
Cristian Duda, David A. Graf, Donald Kossmann
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
15 years 5 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
CSDA
2008
108views more  CSDA 2008»
15 years 3 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
BMCBI
2006
85views more  BMCBI 2006»
15 years 3 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen