3864 search results - page 211 / 773 » time 2005 |
175
click to vote
WABI
2005
Springer
16 years 1 days ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
163
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
166
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Structured ASICs present an attractive alternative to reducing design costs and turnaround times in nanometer designs. As with conventional ASICs, such designs require global wire...
172
click to vote
CHINZ
2005
ACM
15 years 8 months ago
2005
ACM
Beautification of vague, imprecise sketchy ink input is an interesting area for exploration, especially with the emergence of pen-based systems, such as the Tablet PC. Fifty perce...
153
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...