Sciweavers

2107 search results - page 33 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
VLSID
2007
IEEE
149views VLSI» more  VLSID 2007»
14 years 8 months ago
Efficient and Accurate Statistical Timing Analysis for Non-Linear Non-Gaussian Variability With Incremental Attributes
Title of thesis: EFFICIENT AND ACCURATE STATISTICAL TIMING ANALYSIS FOR NON-LINEAR NON-GAUSSIAN VARIABILITY WITH INCREMENTAL ATTRIBUTES Ashish Dobhal, Master of Science, 2006 Thes...
Ashish Dobhal, Vishal Khandelwal, Ankur Srivastava
ICCV
2009
IEEE
13 years 5 months ago
BLOGS: Balanced local and global search for non-degenerate two view epipolar geometry
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
Aveek S. Brahmachari, Sudeep Sarkar
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 7 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
ECCV
2010
Springer
13 years 9 months ago
A coarse-to-fine taxonomy of constellations for fast multi-class object detection
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...
DIS
2004
Springer
13 years 11 months ago
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
: The class of closed patterns is a well known condensed representations of frequent patterns, and have recently attracted considerable interest. In this paper, we propose an effic...
Takeaki Uno, Tatsuya Asai, Yuzo Uchida, Hiroki Ari...