Sciweavers

587 search results - page 31 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 2 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
ASIACRYPT
2006
Springer
13 years 10 months ago
Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys
We introduce a primitive called Hierarchical Identity-Coupling Broadcast Encryption (HICBE) that can be used for constructing efficient collusion-resistant public-key broadcast enc...
Nuttapong Attrapadung, Jun Furukawa, Hideki Imai
TABLETOP
2008
IEEE
14 years 3 months ago
Adaptive interface for text input on large-scale interactive surfaces
In this paper we present a novel approach to text input on large interactive surfaces using a combination of strategies to resolve the inherent difficulties with text input on su...
Johannes Hirche, Peter Bomark, Mikael Bauer, Pawel...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 9 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang