Sciweavers

7952 search results - page 1065 / 1591
» Methods for Measuring Usability
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
16 years 7 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
Benyah Shaparenko, Thorsten Joachims
KDD
2001
ACM
142views Data Mining» more  KDD 2001»
16 years 7 months ago
TreeDT: gene mapping by tree disequilibrium test
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
Petteri Sevon, Hannu Toivonen, Vesa Ollikainen
VLDB
2001
ACM
146views Database» more  VLDB 2001»
16 years 7 months ago
Combining multi-visual features for efficient indexing in a large image database
Abstract. The optimized distance-based access methods currently available for multidimensional indexing in multimedia databases have been developed based on two major assumptions: ...
Anne H. H. Ngu, Quan Z. Sheng, Du Q. Huynh, Ron Le...
PODS
2007
ACM
159views Database» more  PODS 2007»
16 years 7 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
« Prev « First page 1065 / 1591 Last » Next »