Sciweavers

1760 search results - page 235 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 9 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ICPR
2006
IEEE
14 years 9 months ago
Bagging Based Efficient Kernel Fisher Discriminant Analysis for Face Recognition
Kernel Fisher Discriminant Analysis (KFDA) has achieved great success in pattern recognition recently. However, the training process of KFDA is too time consuming (even intractabl...
Baochang Zhang, Shiguang Shan, Wen Gao, Xilin Chen...
COCOA
2009
Springer
14 years 17 days ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
VLSID
2005
IEEE
102views VLSI» more  VLSID 2005»
14 years 8 months ago
Integrated On-Chip Storage Evaluation in ASIP Synthesis
An Application Specific Instruction Set Processor (ASIP) exploits special characteristics of the given application(s) to meet the desired performance, cost and power requirements....
Manoj Kumar Jain, M. Balakrishnan, Anshul Kumar
ICPR
2002
IEEE
14 years 9 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin