13603 search results - page 345 / 2721 » On the Computational Complexity of Cut-Reduction |
240
click to vote
SEMCO
2008
IEEE
16 years 1 months ago
2008
IEEE
We developed a novel analytical environment to aid in the examination of the extensive amount of interconnected data available for genome projects. Our focus is to enable ity and ...
185
Voted
DATE
2006
IEEE
16 years 1 months ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
207
click to vote
VRST
2004
ACM
16 years 28 days ago
2004
ACM
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
197
click to vote
ITICSE
1999
ACM
15 years 12 months ago
1999
ACM
Computer animation is an excellent medium for capturing the dynamic nature of data structure manipulations, and can be used to advantage in the teaching of algorithms and data str...
174
click to vote
SIGECOM
2005
ACM
16 years 1 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...