Sciweavers

8298 search results - page 1364 / 1660
» On the Complexity of Numerical Analysis
Sort
View
184
Voted
BIRTHDAY
2003
Springer
16 years 10 hour ago
Computational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
Krishna V. Palem
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
16 years 8 hour ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
CICLING
2003
Springer
16 years 8 hour ago
Computing with Realizational Morphology
The theory of realizational morphology presented by Stump in his influential book Inflectional Morphology (2001) describes the derivation of inflected surface forms from underly...
Lauri Karttunen
CIVR
2003
Springer
107views Image Analysis» more  CIVR 2003»
16 years 8 hour ago
Fast Video Retrieval under Sparse Training Data
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
Yan Liu, John R. Kender
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
16 years 8 hour ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...
« Prev « First page 1364 / 1660 Last » Next »