Sciweavers

4542 search results - page 399 / 909
» Design patterns for data structures
Sort
View
182
Voted
GLVLSI
2005
IEEE
132views VLSI» more  GLVLSI 2005»
16 years 14 days ago
Interconnect capacitance extraction for system LCD circuits
This paper discusses interconnect capacitance extraction for system LCD circuits, where coupling capacitance is much significant since a ground plane locates far away unlike LSI ...
Yoshihiro Uchida, Sadahiro Tani, Masanori Hashimot...
TSE
2002
71views more  TSE 2002»
15 years 6 months ago
Visualizing Software Changes
A key problem in software engineering is changing the code. We present a sequence of visualizations and visual metaphors designed to help engineers understand and manage the softw...
Stephen G. Eick, Todd L. Graves, Alan F. Karr, Aud...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 4 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld
FUIN
2007
100views more  FUIN 2007»
15 years 6 months ago
Interpreted Nets
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
Ludwik Czaja
PODC
2011
ACM
14 years 9 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...