Sciweavers

4850 search results - page 215 / 970
» Approximate Data Structures with Applications
Sort
View
KDD
1995
ACM
182views Data Mining» more  KDD 1995»
15 years 10 months ago
Accelerated Quantification of Bayesian Networks with Incomplete Data
Probabilistic expert systemsbased on Bayesian networks(BNs)require initial specification both a qualitative graphical structure and quantitative assessmentof conditional probabili...
Bo Thiesson
CC
2005
Springer
120views System Software» more  CC 2005»
15 years 12 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula
ICCV
2009
IEEE
16 years 11 months ago
Structure- and Motion-adaptive Regularization for High Accuracy Optic Flow
The accurate estimation of motion in image sequences is of central importance to numerous computer vision applications. Most competitive algorithms compute flow fields by minimi...
Andreas Wedel, Daniel Cremers, Thomas Pock, Horst ...
164
Voted
ICDT
2003
ACM
127views Database» more  ICDT 2003»
15 years 11 months ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell
251
Voted
GIS
2003
ACM
16 years 7 months ago
Constructing a dem from grid-based data by computing intermediate contours
We present a technique for creating a digital elevation model (DEM) from grid-based contour data. The method computes new, intermediate contours in between existing isolines. Thes...
Michael B. Gousie, Wm. Randolph Franklin