Sciweavers

2597 search results - page 3 / 520
» On numbers of Davenport-Schinzel sequences
Sort
View
TALG
2008
131views more  TALG 2008»
13 years 7 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
JGT
2010
108views more  JGT 2010»
13 years 5 months ago
Hadwiger number and chromatic number for near regular degree sequences
: We consider a problem related to Hadwiger’s Conjecture. Let
Neil Robertson, Zi-Xia Song
CVPR
2011
IEEE
13 years 5 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
CORR
2006
Springer
121views Education» more  CORR 2006»
13 years 7 months ago
Number sequence representation of protein structures based on the second derivative of a folded tetrahedron sequence
A protein is a sequence of amino-acids of length typically less than 1, 000, where there are 20 kinds of amino-acids. In nature, each protein is folded into a well-defined three-d...
Naoto Morikawa
ASE
2010
126views more  ASE 2010»
13 years 7 months ago
Generating a checking sequence with a minimum number of reset transitions
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
Robert M. Hierons, Hasan Ural