Sciweavers

379 search results - page 7 / 76
» Strong reducibility of partial numberings
Sort
View
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 7 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
ERSA
2008
185views Hardware» more  ERSA 2008»
13 years 9 months ago
Design Framework for Partial Run-Time FPGA Reconfiguration
Partial reconfiguration (PR) reveals many opportunities for integration into FPGA design for potential system optimizations such as reduced area, increased performance, and increa...
Chris Conger, Ann Gordon-Ross, Alan D. George
CIKM
2008
Springer
13 years 9 months ago
REDUS: finding reducible subspaces in high dimensional data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. The most well known approaches for high dimensional data analysis are...
Xiang Zhang, Feng Pan, Wei Wang 0010
WSC
1998
13 years 9 months ago
Sequential Allocations that Reduce Risk for Multiple Comparisons
We consider how to efficiently allocate computing resources in order to infer the best of a finite set of simulated systems, where best means that the system has the maximal expec...
Stephen E. Chick, Koichiro Inoue
ICPR
2008
IEEE
14 years 8 months ago
Fingerprint indexing based on composite set of reduced SIFT features
Most of current fingerprint indexing schemes utilize features based on global textures and minutiae structures. To extend the existing technology of feature extraction, this paper...
Xin Shuai, Chao Zhang, Pengwei Hao