Sciweavers

5606 search results - page 719 / 1122
» Randomization Techniques for Graphs.
Sort
View
TALG
2010
74views more  TALG 2010»
15 years 5 months ago
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on timespace tradeoffs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median ...
Timothy M. Chan
TCS
2010
15 years 5 months ago
Maximum likelihood analysis of algorithms and data structures
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
Ulrich Laube, Markus E. Nebel
CHI
2009
ACM
15 years 4 months ago
Semantically structured tag clouds: an empirical evaluation of clustered presentation approaches
Tag clouds have become a frequently used interaction technique in the web. Recently several approaches to present tag clouds with the tags semantically clustered have been propose...
Johann Schrammel, Michael Leitner, Manfred Tscheli...
ICCAD
2009
IEEE
87views Hardware» more  ICCAD 2009»
15 years 4 months ago
The synthesis of combinational logic to generate probabilities
As CMOS devices are scaled down into the nanometer regime, concerns about reliability are mounting. Instead of viewing nanoscale characteristics as an impediment, technologies suc...
Weikang Qian, Marc D. Riedel, Kia Bazargan, David ...
ICCV
2009
IEEE
15 years 4 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...