2127 search results - page 285 / 426 » Computing large matchings fast |
104
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
212
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
175
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
126
click to vote
ARC
2010
Springer
15 years 11 months ago
2010
Springer
Dot-products are one of the essential and recurrent building blocks in scientific computing, and often take-up a large proportion of the scientific acceleration circuitry. The ac...
171
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
A communication trace is a detailed record of the communication between two entities. Communication traces are vital for research in computer networks and protocols in many domain...