Sciweavers

20441 search results - page 152 / 4089
» Locally Computable Structures
Sort
View
APAL
2007
104views more  APAL 2007»
14 years 12 months ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi
PVLDB
2010
190views more  PVLDB 2010»
14 years 6 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
ICPR
2008
IEEE
16 years 1 months ago
3D model based vehicle localization by optimizing local gradient based fitness evaluation
We address the problem of 3D model based vehicle localization in calibrated traffic scenes. A wireframe vehicle model is set up as prior information and an efficient local gradien...
Kaiqi Huang, Min Li, Tieniu Tan, Zhaoxiang Zhang
CLOR
2006
15 years 3 months ago
Object Detection and Localization Using Local and Global Features
Traditional approaches to object detection only look at local pieces of the image, whether it be within a sliding window or the regions around an interest point detector. However, ...
Kevin P. Murphy, Antonio B. Torralba, Daniel Eaton...