Sciweavers

10493 search results - page 259 / 2099
» Dynamic Word Problems
Sort
View
108
Voted
ECCV
2010
Springer
15 years 7 months ago
Handling Urban Location Recognition as a 2D Homothetic Problem
Abstract. We address the problem of large scale place-of-interest recognition in cell phone images of urban scenarios. Here, we go beyond what has been shown in earlier approaches ...
FOCS
2009
IEEE
15 years 6 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIAMSC
2008
206views more  SIAMSC 2008»
15 years 2 months ago
The Compact Discontinuous Galerkin (CDG) Method for Elliptic Problems
We present a compact discontinuous Galerkin (CDG) method for an elliptic model problem. The problem is first cast as a system of first order equations by introducing the gradient o...
Jaime Peraire, Per-Olof Persson
TOC
2008
94views more  TOC 2008»
15 years 2 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
EAAI
2010
119views more  EAAI 2010»
15 years 26 days ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...