Sciweavers

2168 search results - page 361 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 8 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
ISPD
2004
ACM
161views Hardware» more  ISPD 2004»
15 years 8 months ago
Early-stage power grid analysis for uncertain working modes
High performance integrated circuits are now reaching the 100-plus watt regime, and power delivery and power grid signal integrity have become critical. Analyzing the performance ...
Haifeng Qian, Sani R. Nassif, Sachin S. Sapatnekar
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 8 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
SSDBM
2003
IEEE
123views Database» more  SSDBM 2003»
15 years 8 months ago
MoBIoS: A Metric-Space DBMS to Support Biological Discovery
MoBIoS is a specialized database management system whose storage manager is based on metric-space indexing, and whose query language entails biological data types. When relational...
Daniel P. Miranker, Weijia Xu, Rui Mao
SIGGRAPH
2010
ACM
15 years 7 months ago
3D modeling with silhouettes
We present a new sketch-based modeling approach in which models are interactively designed by drawing their 2D silhouettes from different views. The core idea of our paper is to l...
Alec Rivers, Frédo Durand, Takeo Igarashi