Sciweavers

9842 search results - page 1523 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
DOCENG
2008
ACM
15 years 8 months ago
Improving query performance on XML documents: a workload-driven design approach
As XML has emerged as a data representation format and as great quantities of data have been stored in the XML format, XML document design has become an important and evident issu...
Rebeca Schroeder, Ronaldo dos Santos Mello
ISLPED
2007
ACM
57views Hardware» more  ISLPED 2007»
15 years 8 months ago
Resource area dilation to reduce power density in throughput servers
Throughput servers using simultaneous multithreaded (SMT) processors are becoming an important paradigm with products such as Sun's Niagara and IBM Power5. Unfortunately, thr...
Michael D. Powell, T. N. Vijaykumar
BCSHCI
2008
15 years 8 months ago
Low cost prototyping: part 2, or how to apply the thinking-aloud method efficiently
Customer satisfaction with regard to user interfaces becomes increasingly more important and is, eventually, decisive for the selection of systems within a competitive market. End...
Andreas Holzinger, Stephen Brown
DAGSTUHL
2007
15 years 8 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
DAGSTUHL
2007
15 years 8 months ago
Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
Bodo Manthey, Till Tantau
« Prev « First page 1523 / 1969 Last » Next »