Sciweavers

1489 search results - page 244 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
ACMICEC
2004
ACM
205views ECommerce» more  ACMICEC 2004»
14 years 2 months ago
M-Modeler: a framework implementation for modeling m-commerce applications
At the present time, the use of mobile technology in business, is becoming an opportunity to generate competitive advantages within organization environments. Mobile technology he...
Ana Hilda Morales-Aranda, Oscar Mayora-Ibarra, San...
CEC
2008
IEEE
14 years 3 months ago
Fast symmetric keys generation via mutual mirroring process
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
Chun-Shun Tseng, Ya-Yun Jheng, Sih-Yin Shen, Jung-...
CC
2008
Springer
172views System Software» more  CC 2008»
13 years 11 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...
PAMI
2010
192views more  PAMI 2010»
13 years 7 months ago
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
Carlos Alzate, Johan A. K. Suykens
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 3 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...