Sciweavers

2490 search results - page 475 / 498
» A General Method for Feature Matching and Model Extraction
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
CVPR
2010
IEEE
14 years 4 months ago
Recovering Fluid-type Motions Using Navier-Stokes Potential Flow
The classical optical flow assumes that a feature point maintains constant brightness across the frames. For fluidtype motions such as smoke or clouds, the constant brightness ass...
Feng Li, Liwei Xu, Philippe Guyenne, Jingyi Yu
SIGIR
2010
ACM
13 years 11 months ago
Context-aware ranking in web search
The context of a search query often provides a search engine meaningful hints for answering the current query better. Previous studies on context-aware search were either focused ...
Biao Xiang, Daxin Jiang, Jian Pei, Xiaohui Sun, En...
TSMC
1998
91views more  TSMC 1998»
13 years 7 months ago
Toward the border between neural and Markovian paradigms
— A new tendency in the design of modern signal processing methods is the creation of hybrid algorithms. This paper gives an overview of different signal processing algorithms si...
Piotr Wilinski, Basel Solaiman, A. Hillion, W. Cza...
ISI
2008
Springer
13 years 7 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh