Sciweavers

11214 search results - page 333 / 2243
» Just-in-time data structures
Sort
View
ICSE
1999
IEEE-ACM
15 years 11 months ago
Identifying Objects Using Cluster and Concept Analysis
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
Arie van Deursen, Tobias Kuipers
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 6 months ago
Exact Shortest Path Queries for Planar Graphs Using Linear Space
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
Shay Mozes, Christian Sommer
CGF
2002
116views more  CGF 2002»
15 years 6 months ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
ML
2010
ACM
151views Machine Learning» more  ML 2010»
15 years 5 months ago
Inductive transfer for learning Bayesian networks
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
Roger Luis, Luis Enrique Sucar, Eduardo F. Morales
ILP
1999
Springer
15 years 11 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller