Sciweavers

12825 search results - page 1979 / 2565
» Improved PLSOM algorithm
Sort
View
SAS
2010
Springer
143views Formal Methods» more  SAS 2010»
15 years 5 months ago
Points-to Analysis as a System of Linear Equations
The efficiency of a points-to analysis is critical for several compiler optimizations and transformations, and has attracted considerable research attention. Despite several advanc...
Rupesh Nasre, Ramaswamy Govindarajan
TIFS
2010
94views more  TIFS 2010»
15 years 5 months ago
Plastic surgery: a new dimension to face recognition
Abstract—Advancement and affordability is leading to popularity of plastic surgery procedures. Facial plastic surgery can be reconstructive to correct facial feature anomalies or...
Richa Singh, Mayank Vatsa, Himanshu S. Bhatt, Sama...
ICPR
2010
IEEE
15 years 5 months ago
Enhancing Web Page Classification via Local Co-training
Abstract--In this paper we propose a new multi-view semisupervised learning algorithm called Local Co-Training (LCT). The proposed algorithm employs a set of local models with vect...
Youtian Du, Xiaohong Guan, Zhongmin Cai
IPPS
2010
IEEE
15 years 5 months ago
Tile QR factorization with parallel panel processing for multicore architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
Bilel Hadri, Hatem Ltaief, Emmanuel Agullo, Jack D...
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 7 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
« Prev « First page 1979 / 2565 Last » Next »