Sciweavers

7015 search results - page 1229 / 1403
» Approximation algorithms for co-clustering
Sort
View
ECCV
2004
Springer
14 years 3 months ago
Probabilistic Spatial-Temporal Segmentation of Multiple Sclerosis Lesions
Abstract. In this paper we describe the application of a novel statistical videomodeling scheme to sequences of multiple sclerosis (MS) images taken over time. The analysis of the ...
Allon Shahar, Hayit Greenspan
HUC
2004
Springer
14 years 3 months ago
Particle Filters for Location Estimation in Ubiquitous Computing: A Case Study
Location estimation is an important part of many ubiquitous computing systems. Particle filters are simulation-based probabilistic approximations which the robotics community has ...
Jeffrey Hightower, Gaetano Borriello
IMR
2004
Springer
14 years 3 months ago
Identification and Preservation of Surface Features
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
Timothy J. Baker
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 3 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
« Prev « First page 1229 / 1403 Last » Next »