3946 search results - page 36 / 790 » The computational complexity of choice sets |
120
click to vote
EWSN
2008
Springer
15 years 11 months ago
2008
Springer
Component-based architectures are the traditional approach cile application specific optimization with reusable abstractions in sensor networks. However, they frequently overwhelm ...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
Graph-cuts based algorithms are effective for a variety
of segmentation tasks in computer vision. Ongoing research
is focused toward making the algorithms even more general,
as ...
158
click to vote
DAC
2003
ACM
15 years 5 months ago
2003
ACM
Instruction set simulators are critical tools for the exploration and validation of new programmable architectures. Due to increasing complexity of the architectures and timeto-ma...
103
click to vote
AAAI
2010
15 years 1 months ago
2010
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
106
click to vote
IJCAI
2007
15 years 1 months ago
2007
Clustering accuracy of partitional clustering algorithm for categorical data primarily depends upon the choice of initial data points (modes) to instigate the clustering process. ...