Sciweavers

16666 search results - page 191 / 3334
» Descriptive and Computational Complexity
Sort
View
ECCV
2006
Springer
16 years 8 months ago
Coloring Local Feature Extraction
Although color is commonly experienced as an indispensable quality in describing the world around us, state-of-the art local featurebased representations are mostly based on shape ...
Joost van de Weijer, Cordelia Schmid
DCC
1999
IEEE
15 years 10 months ago
Quantized Frame Expansions as Source-Channel Codes for Erasure Channels
Quantized frame expansions are proposed as a method for generalized multiple description coding, where each quantized coe cient is a description. Whereas previous investigations h...
Vivek K. Goyal, Jelena Kovacevic, Martin Vetterli
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
15 years 7 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
Kai-Florian Richter, Matt Duckham
ENTCS
2010
118views more  ENTCS 2010»
15 years 3 months ago
Fragments-based Model Reduction: Some Case Studies
Molecular biological models usually suffer from a dramatic combinatorial blow up. Indeed, proteins form complexes and can modify each others, which leads to the formation of a hug...
Jérôme Feret
UPP
2004
Springer
15 years 12 months ago
Programming an Amorphous Computational Medium
Amorphous computing considers the problem of controlling millions of spatially distributed unreliable devices which communicate only with nearby neighbors. To program such a system...
Jacob Beal