45 search results - page 4 / 9 » Discovering All Most Specific Sentences by Randomized Algori... |
NIPS
2004
13 years 10 months ago
2004
We address the problem of identifying specific instances of a class (cars) from a set of images all belonging to that class. Although we cannot build a model for any particular in...
SIGSOFT
2006
ACM
14 years 9 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
MCS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
FPGA
2000
ACM
14 years 5 days ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
ASPDAC
1995
ACM
14 years 3 days ago
1995
ACM
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...