394 search results - page 62 / 79 » Computing Minimal Polynomials of Matrices |
214
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Given an integer k, a representative skyline contains the k skyline points that best describe the tradeoffs among different dimensions offered by the full skyline. Although this to...
119
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
DAC
2009
ACM
15 years 7 months ago
2009
ACM
It is unknown how to include stochastic process variation into fast-multipole-method (FMM) for a full chip capacitance extraction. This paper presents a parallel FMM extraction us...
106
Voted
BROADNETS
2006
IEEE
15 years 6 months ago
2006
IEEE
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
87
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...