Sciweavers

5169 search results - page 805 / 1034
» Locality approximation using time
Sort
View
SEMWEB
2005
Springer
15 years 10 months ago
Ontology Based Analysis of Experimental Data
We address the problem of linking observations from reality to a semantic web based knowledge base. Concepts in the biological domain are increasingly being formalized through ont...
Andrea Splendiani
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 10 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
ISMIR
2004
Springer
157views Music» more  ISMIR 2004»
15 years 10 months ago
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem
We consider the music pattern matching problem—to find occurrences of a small fragment of music called the “pattern” in a larger body of music called the “score”—as a...
Anna Lubiw, Luke Tanur
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
15 years 10 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
SEKE
2004
Springer
15 years 10 months ago
Supporting the Requirements Prioritization Process. A Machine Learning approach
Requirements prioritization plays a key role in the requirements engineering process, in particular with respect to critical tasks such as requirements negotiation and software re...
Paolo Avesani, Cinzia Bazzanella, Anna Perini, Ang...