Sciweavers

1933 search results - page 290 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
16 years 3 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
171
Voted
ACCV
2009
Springer
15 years 10 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
15 years 10 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
EUROPAR
2009
Springer
15 years 10 months ago
Adaptive Parallel Householder Bidiagonalization
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
Fangbin Liu, Frank J. Seinstra
129
Voted
WINE
2007
Springer
126views Economy» more  WINE 2007»
15 years 9 months ago
A Theory of Loss-Leaders: Making Money by Pricing Below Cost
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
Maria-Florina Balcan, Avrim Blum, T.-H. Hubert Cha...