Sciweavers

1301 search results - page 101 / 261
» Bounded Version Vectors
Sort
View
112
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 29 days ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
140
Voted
GD
2005
Springer
15 years 9 months ago
Drawing Kn in Three Dimensions with One Bend Per Edge
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounde...
Olivier Devillers, Hazel Everett, Sylvain Lazard, ...
133
Voted
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 7 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
142
Voted
MSS
2008
IEEE
112views Hardware» more  MSS 2008»
15 years 3 months ago
Axiomatization of stochastic models for choice under uncertainty
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...
John K. Dagsvik
114
Voted
SIAMDM
1998
102views more  SIAMDM 1998»
15 years 3 months ago
A New Decoding Algorithm for Complete Decoding of Linear Block Codes
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
Yunghsiang S. Han