Sciweavers

4850 search results - page 880 / 970
» Approximate Data Structures with Applications
Sort
View
168
Voted
RE
2007
Springer
16 years 19 days ago
Goal-Oriented Conceptual Database Design
We present details of a goal-oriented process for database requirements analysis. This process consists of a number of steps, spanning the spectrum from high-level stakeholder goa...
Lei Jiang, Thodoros Topaloglou, Alexander Borgida,...
WADS
2007
Springer
156views Algorithms» more  WADS 2007»
16 years 19 days ago
Cuttings for Disks and Axis-Aligned Rectangles
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
Eynat Rafalin, Diane L. Souvaine, Csaba D. T&oacut...
XSYM
2007
Springer
150views Database» more  XSYM 2007»
16 years 19 days ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
CCGRID
2006
IEEE
16 years 17 days ago
SSB : A Grid-based Infrastructure for HLA Systems
Service Oriented EXtensible Modeling and Simulation Supporting Environment Architecture (SO-XMSSEA) is presented based on XMSF thinking and the new technology development of web s...
Xu Li-juan, Peng Xiao-yuan
CVPR
2006
IEEE
16 years 17 days ago
Fast Variational Segmentation using Partial Extremal Initialization
In this paper we consider region-based variational segmentation of two- and three-dimensional images by the minimization of functionals whose fidelity term is the quotient of two...
Jan Erik Solem, Niels Chr. Overgaard, Markus Perss...