738 search results - page 141 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
KDD
2003
ACM
15 years 10 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
120
click to vote
IJVR
2008
14 years 8 months ago
2008
As environments become smart in accordance with advances in ubiquitous computing technology, researchers are struggling to satisfy users' diverse and sophisticated demands. Th...
165
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
WISEC
2009
ACM
15 years 4 months ago
2009
ACM
In wireless sensor networks, it is critical to restrict the network access only to eligible sensor nodes, while messages from outsiders will not be forwarded in the networks. In t...
DCC
1995
IEEE
15 years 1 months ago
1995
IEEE
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...