Sciweavers

9842 search results - page 1740 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CHI
2005
ACM
16 years 4 months ago
Privacy gradients: exploring ways to manage incidental information during co-located collaboration
This research introduces privacy issues related to the viewing of incidental information during co-located collaboration. Web browsers were the representative application used in ...
Kirstie Hawkey, Kori M. Inkpen
CHI
2005
ACM
16 years 4 months ago
Implications for designing the user experience of DVD menus
DVD menus often miss out on usability and are complex and difficult to navigate through. One of the main problems is the lack of design standards. By conducting an expert walkthro...
Thomas Költringer, Martin Tomitsch, Karin Kap...
VLSID
2006
IEEE
148views VLSI» more  VLSID 2006»
16 years 4 months ago
Efficient Design and Analysis of Robust Power Distribution Meshes
With increasing design complexity, as well as continued scaling of supplies, the design and analysis of power/ground distribution networks poses a difficult problem in modern IC d...
Puneet Gupta, Andrew B. Kahng
VLSID
2002
IEEE
136views VLSI» more  VLSID 2002»
16 years 4 months ago
Buffered Routing Tree Construction under Buffer Placement Blockages
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
Wei Chen, Massoud Pedram, Premal Buch
HPCA
2004
IEEE
16 years 4 months ago
Exploring Wakeup-Free Instruction Scheduling
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
Jie S. Hu, Narayanan Vijaykrishnan, Mary Jane Irwi...
« Prev « First page 1740 / 1969 Last » Next »