Sciweavers

2124 search results - page 30 / 425
» Repairing Structurally Complex Data
Sort
View
TIC
2000
Springer
174views System Software» more  TIC 2000»
13 years 11 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
TGIS
2010
86views more  TGIS 2010»
13 years 2 months ago
A Road Network Selection Process Based on Data Enrichment and Structure Detection
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...
Guillaume Touya
ICCS
2007
Springer
13 years 11 months ago
Discovering Latent Structures: Experience with the CoIL Challenge 2000 Data Set
We present a case study to demonstrate the possibility of discovering complex and interesting latent structures using hierarchical latent class (HLC) models. A similar effort was m...
Nevin Lianwen Zhang
ENTCS
2007
156views more  ENTCS 2007»
13 years 7 months ago
Bounded Model Checking with Parametric Data Structures
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
Erika Ábrahám, Marc Herbstritt, Bern...
ICMCS
2008
IEEE
336views Multimedia» more  ICMCS 2008»
14 years 2 months ago
SIMD optimization of the H.264/SVC decoder with efficient data structure
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
Joohyun Lee, Gwanggil Jeon, Sangjun Park, Taeyoung...