Sciweavers

10988 search results - page 308 / 2198
» Algorithmic Folding Complexity
Sort
View
151
Voted
DBA
2004
111views Database» more  DBA 2004»
15 years 6 months ago
Effective Decompositioning of Complex Spatial Objects into Intervals
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ADHOCNOW
2009
Springer
15 years 5 months ago
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplo...
SIGMOD
2010
ACM
249views Database» more  SIGMOD 2010»
15 years 4 months ago
Worry-free database upgrades: automated model-driven evolution of schemas and complex mappings
Schema evolution is an unavoidable consequence of the application development lifecycle. The two primary schemas in an application, the client conceptual object model and the pers...
James F. Terwilliger, Philip A. Bernstein, Adi Unn...
DAWAK
2010
Springer
15 years 4 months ago
Modelling Complex Data by Learning Which Variable to Construct
Abstract. This paper addresses a task of variable selection which consists in choosing a subset of variables that is sufficient to predict the target label well. Here instead of tr...
Françoise Fessant, Aurélie Le Cam, M...
EOR
2008
103views more  EOR 2008»
15 years 4 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...