Sciweavers

716 search results - page 123 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
15 years 4 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 4 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
ICCV
2009
IEEE
14 years 9 months ago
On optimizing subspaces for face recognition
We propose a subspace learning algorithm for face recognition by directly optimizing recognition performance scores. Our approach is motivated by the following observations: 1) Di...
Jilin Tu, Xiaoming Liu, Peter Henry Tu
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
15 years 5 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...
SENSYS
2004
ACM
15 years 4 months ago
Medians and beyond: new aggregation techniques for sensor networks
Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensors, however, have significant power constraint (battery life), makin...
Nisheeth Shrivastava, Chiranjeeb Buragohain, Divya...